Question 3: Selection Problems [15 Points a) [5 pts) Using fink" element algorithm find the 4th (0-based) element in this list A= 8,4,2,7,14,10. 4 2 7 14 10 2 Pivot 8 8 7 1 4 2 3 14 10 Ans b) 15 pts) Complete the missing part for findka element algorithm int find" (int E[], int first, int last, int k) if (first-last) ans = E[first): else int splitPoint - partition(E. first, last): it splitput ==k reh ACsplitp t] else if splitput->k else findKH ( A, first, split pent-1) splitputti, Last) M c) (5 pts] The optimal solution to find max and min cost 3n/2-2. Justify this equation. 2-1 /21 34 2 - 2 Question 3: Selection Problems [15 Points a) [5 pts) Using fink" element algorithm find the 4th (0-based) element in this list A= 8,4,2,7,14,10. 4 2 7 14 10 2 Pivot 8 8 7 1 4 2 3 14 10 Ans b) 15 pts) Complete the missing part for findka element algorithm int find" (int E[], int first, int last, int k) if (first-last) ans = E[first): else int splitPoint - partition(E. first, last): it splitput ==k reh ACsplitp t] else if splitput->k else findKH ( A, first, split pent-1) splitputti, Last) M c) (5 pts] The optimal solution to find max and min cost 3n/2-2. Justify this equation. 2-1 /21 34 2 - 2