Pick a strategy (from Dynamic Programming and Divide & Conquer) to solve each of the problems given below. Justify your answer. Sketch/pseudocode subproblems for the strategy you choose to design each question.

Question 1: Given an array of unsorted positive integers, find the closest value in that array to a given input number (say key). DP/Divide & conquer ? Subproblem?

Question 2: An n element array is filled with the results of a geometric progression. One element is missing in the progression, find the missing number. DP/Divide & conquer ? Subproblem?

Question 3: Search a key in a 2-D matrix where the data in the matrix is sorted row-wise as well as column wise. DP/Divide & conquer ? Subproblem?

Question 4: Find the value of continuous function F(n) = F(n^n) + ceil (n/2) for first 100 values. DP/Divide & conquer ? Subproblem?

Question 5: Find the first unique element in a sorted array. DP/Divide & conquer? Subproblem

Please answer Asap