For each of the following statements, select if is TRUE or F…
For each of the following statements, select if is TRUE or FALSE: (a) The approximation algorithm seen in class for the KNAPSACK problem always outputs an optimal solution. (b) Approximation algorithms approximate the best possible running time of an algorithm for solving the given problem. (c) A search operation (for a given key) on a skip list is always guaranteed to run in O(log n) time, where n is the number of elements in the list. (d) A search operation on a skip list can sometimes output the wrong node. (e) Skip lists are guaranteed to half the number of elements at each level, as we go up the levels of the data structure.