11. Which of the following problems can't be solved using recursion? A) Factorial of a number B) Nth fibonacci number C) Length of a string D) Problems without base case Ans: 12. Which of the following statements is true? A) Recursion is always better than iteration B) Recursion uses more memory compared to iteration C) Recursion uses less memory compared to iteration D) Iteration is always better and simpler than recursion Ans: Part II: For only one of the Following problems; Do the Following State the problem statement, Write an optimal Algorithm to solve the problem, Deduce the running time of this Algorithm 1. Longest Common Subsequence Problem: 2. Minimum Spanning Trees 3. "Counting Money Problem" that count out a certain amount of money, using the fewest possible bills and coins Hint using Greedy Algorithms. 4. Shortest Path Problem: 5. Finding Medians: 6. Convex Hull Problem: