Question 16
*Morteza* has $100$ sets. At each step *Mahdi* can choose two distinct sets from them and Morteza tells him the intersection and union of those two sets. Find the least possible number of steps that *Mahdi* can determine all of $100$ sets.