By using $60$ matchsticks, $5\times5$ matchstick matrix is formed as below:
There are totally $55$ squares including all type of squares (such as $25$ $1\times1$ squares, $16$ $2\times2$ squares etc.)
What is the minimum number of matchsticks needed to be removed not to have a single square left in the shape above?