Question GIVEN ARRAY: {50, 94, 65, 71, 41, 37, 38, 40, 14) QuickSort is a Divide and Conquer algorithm. It picks an element as pivot and partitions the given array around the picked pivot. There are many different versions of QulckSort that pick pivot in different ways. Always pick first element as pivot. Always pick last element as pivot Pick a random element as pivot. Pick median as pivot. 1. Using the "Always pick first element as pivot", illustrate the step by step to sot the array using QUICK SORT. 2. Based on question 1, Command this in any programming language. (Copy the source Code and screen shot the output in your answer) 3. Using the "Always pick last element as pivot", illustrate the step by step to sort the array using QUICK SORT. 4. Using binary search, search number 71 in the array and give the efficiency time