This is my question.

Question 4 20 pts Sandra likes to build squares using matches. She has found an optimal way to build squares using the lowest number of matches. For example, she can build 5 squares with 12 matches as shown in the diagram below by "lling" 4 small squares into the larger square . D 1 square 5 squares 4 matches 12 matches Assume all matches are the same length, which is the size of a smaller square. No other assumptions are needed so in this question you need to focus on the model. How many matches are needed to build such a square for |=10? How many squares [of any size) are included into that square of |=10? Hint: do not brute force but nd a pattern for the formulas by looking at |=3 and |=4