#Python language

Note that coding is not required only psudocode is required for every part.

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 part. i) 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? ii) 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? iii) 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? F(n^n) + ceil (n/2) for first 100 values. iv) Find the value of continuous function F(n) DP/Divide & conquer ? Subproblem? v) Find the first unique element in a sorted array. DP/Divide & conquer? Subproblem? Best of luck