3) Suppose there are seven coins, all with the same weight, and a counterfeit coin that weighs less than the others. How many weighings are necessary using a balance scale to determine which other the eight coins is the counterfeit one? a) 3 b)4 c)5 d)2 4) Which one of the following is true: A simple graph is connected if and only if a) It is large b) It has no edges c) it has a spanning tree d) none of the choice 5) Let T, T1, T2 be full binary trees, such that T=T1 . T2. Let h(T) be the height of T. Then what is h(T) in terms of h(T1) and h(T2)