You are given two arrays each containing n floating point numbers with the following properties: f[]: values are in non-decreasing order (smallest to largest) g values are non-increasing order (largest to smallest) We want to find an index i such that MAX (f[i], g[i]) is minimized (over all indices i) In other words, we have the following objective: min (max(f[i], g[i])) (A) : Warmup - Given an example instance of this problem with n=10. 1. Specify the contents of both arrays f and g[]. 2. Make things "non-trivial" -- e.g., although two arrays populated with identical values is a valid input, it is not very interesting 3. For each index show the maximum of the two corresponding array entries. 4. Identify an index which yields the minimum value from (3 (In general, there may be more than one such index) (template given below.. .) max