The area of the tray that is used up in stacking the burfis will be least if the sweet seller stacks maximum number of burfis in each stack. Since each stack must have the same number of burfis. Therefore, the number of stacks will be least if the number of burfis in each stack is equal to the HCF of 420 and 130.
Now, let us use Euclid’s algorithm to find their HCF. We have :
420 = 130 × 3 + 30
130 = 30 × 4 + 10
30 = 10 × 3 + 0
So, the HCF of 420 and 130 is 10.
Hence,the sweet seller can make stacks of 10 burfis of each kind to cover the least area of the tray.
Please mark it brainiest answer.................................