A graph with max 5 nodes that fulfils the folowing requirements

Question

It should contain exactly four cycles and these should all have length 4; ii) Your graph should contain a node which has degree 3; iii) Your graph should contain a subgraph which is a tree that has a depth of 3 and which has two nodes at level 2. iv) Your graph should contain the smallest number of nodes possible given the constraints above.

Answer 1

Here is a graph that satisfy the conditions I think: