One of four coins is countefeit and is either too heavy or too light.The problem is to identify the counterfeit coin but not to determine whether it is heavy or light. What is the lower bound on the number of comparisons required to solve this problem in the worst case? Show work.