Essay
Suppose you have 5 coins, one of which is counterfeit (either heavier or lighter than the other four). You use a pan balance scale to find the bad coin and determine whether it is heavier or lighter.
(a) Prove that 2 weighings are not enough to guarantee that you find the bad coin and determine whether it is heavier or lighter.
(b) Draw a decision tree for weighing the coins to determine the bad coin (and whether it is heavier or lighter) in the minimum number of weighings.
Correct Answer:

Verified
Correct Answer:
Verified
Q1: Find a spanning tree of minimum cost
Q2: refer to this graph. <img src="https://d2lvgg3v3hfg70.cloudfront.net/TB6843/.jpg" alt="refer
Q4: Find a spanning tree for the
Q5: Use the merge sort to sort the
Q6: fill in the blanks.<br>-Every full binary tree
Q7: refer to this graph. <img src="https://d2lvgg3v3hfg70.cloudfront.net/TB6843/.jpg" alt="refer
Q8: refer to this graph. <img src="https://d2lvgg3v3hfg70.cloudfront.net/TB6843/.jpg" alt="refer
Q9: Write the compound proposition <span
Q10: refer to this graph. <img src="https://d2lvgg3v3hfg70.cloudfront.net/TB6843/.jpg" alt="refer
Q11: There is a tree with degrees 3,