Answer:
nhngbvftgyhujmnhb vcdfrtgyhujmn bvvvbnhbgv
Step-by-step explanation: vbhnjhbvfcdfgtyhujiuhygvfcdcfvgh
least possible number of sweets = lowest common multiple of 5,6 & 10 - 2
-I hope this helps! I got it figured out until near like the very end.-
-Please mark as brainliest!- Thanks!