Problem Solving: Using OOP concepts solve the following problems. Each correct answer is 2 points. Using Linear Search and the array below, indicate the total number of comparisons to find 15 and 50 38 5 49 41 60 71 12 54 15 32 86 13 16 77 1 63 Using Selection Sort, put the below array in ascending order. Only show its first 4 iterations. For each iteration, indicate the index of the selected value Original 74 85 65 78 82 79 67 75 Using Insertion Sort, put the below array in descending order. Only show its first 4 iterations. For each iteration, indicate the index of the "inserted value Original 24 35 15 28 32 29 17 25 search uses a loop to sequentially step through an array. A) binary B) unary C) linear D) relative E) bubble 12) if a binary search is used to search for the number 4 in the 11-element array A defined as: int A[] (1, 2, 3, 4, 6, 7, 8, 9, 10, 12, 17); which value will the 4 be compared to first? A) 1 B) 7 C) 8 D9E) 17 13) True/False: When searching for a particular object in an array of objects, it is necessary to compare the search key to the value in each examined object's key field. A) True B) False 14) If algorithm Arequires 2n + 1 basic operations to process an input of size n, and Algorithm B requires 3n+ 2 basic operations to process the same input, algorithms A and B are considered to be equally efficient. A) True B) False