Total number of squares in a $$n\times n$$ chessboard = $$\sum_1^n$$ $$(n)^2$$
and total number of rectangles = $$C_2^{(n+1)}\times C_2^{(n+1)}$$
=> Number of rectangles = $$C_2^9\times C_2^9$$
= $$36\times36=1296$$
=> Ans - (D)
Create a FREE account and get: