Q.No.1. [CLO-3, C-3]|Marks 101 Suppose you are given n sets having n number of coins. Every set contains one fake coin. Your target is to find out that particular coin from every set. What type of data structure you would use to hold these coins and write C++ function that will find the fake coin in given set of coins. Q.No.2 (CLO-2, C-2]|Marks 10) Propose a function in stacks named Eliminate_Negatives(), which removes all of the negative numbers from a stack of numbers. The remaining numbers should be left in the same relative order. For example: -9 7 -6 -2 -3 -4 7 0 1 1