Algorithm Design

1. 115 Points] State whether TRUE or FALSE: The greedy technique may not yield the optimal solution to some problems, B. The greedy change making algorithm gives optimal solution for all coin denominations. C. In the greedy technique, a choice made at any step may not be backtracked and changed. D. Prim's algorithm may not give the optimal solution in some cases E. A. Kruskal's algorithm always yields the optimal solution. F. In Prim's algorithm, the spanning tree being built is always connected at every step. G. The intermediary results of the Kruskal's algorithm will always be a connected tree. H. The complexity of all recursive algorithms is exponential L The nodes of a minimum spanning tree can have degrees of at most 2 J. The minimum spanning tree for a graph may not be unique. KAverage-case complexity computation is generally more involved than worst-case complexity L. The exhaustive search technique always yields the optimal value. M. The greedy technique for building the Huffman tree algorithm is optimal. N. The Huffiman code for the most frequently occurring symbol has the most number of bits. O. The Huffman tree is always a binary tree