Maximizing these squares! 2

Great question :+1: Had fun solving

---

To get maximum number of squares by a combination, we have to arrange them in such a way that their corresponding edges lie in the line segment connecting the opposite ends of a square (or in other words, they should lie on the diagnol of a square.

In this question we should make the following figure.

There are $16$ squares in the figure above and that is the maximum possible squares.

A $square$ can be $formed$ from $two$ $squares$ when they both $cut$ $each$ $other$ $twice$ (thus, a square formed is made by $two$ $sides$ $of$ $one$ $square$ and $the$ $other$ $two$ $sides$ of the $other$ $square$ )

So, from $four$ squares maximum number of squares are possible only when $each$ $one$ $of$ $them$ cut the other $three$ $twice$ .

And we get this: