Warm-up Question: Pick the best strategy (from Dynamic Programming and Divide \& Conquer) to solve each of the problems given below. Justify your answer. Sketch pseudocode for the strategy you choose to solve each question. A: Given an array of unsorted positive integers, find the closest value in that array to a given input number (say key). DP/Divide \& conquer? B: 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? C: 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? D: Find the value of continuous function F(n)=F(n/2n/3)+ ceil (n/2) for first 100 values. DP/Divide \& conquer? E: Find the first unique (not duplicated) element in a sorted array. DP/Divide \& conquer? Dynamic Problem: Write down "1+1+1+1+1+1+1+1 = " on a sheet of paper. "What's that equal to?" Counting "Eight!". Write down another "1+" on the left. "What about that?" "Nine!" " How'd you know (so quickly) it was nine?" "You just added one more!" "So, you didn't need to re-count because you remembered there were eight before! Dynamic Programming is just a fancy way to say remembering stuff to save time later