4. illustrate Partition algorithm of Quick Sort on the following data: (15 points) 70 30 80 50 90 40 60 55 Show all the steps and compute the runtime. Runtime Explanation of Detailed Algorithm 5. Write down the pseudo-code for Quick Sort, with given three inputs: A (an array), p (first index) andr (last index). (10 points)