1. Consider an array of 6 elements (keys should be your student ID). Apply quick sort steps manually and show the results at each step. 2. Consider the question that you attempted earlier in which you sorted an array with keys as your student ID. Look at your solution and see how many comparison operations your performed? 3. Do some research to understand which element should be chosen to be partition element and how it effects efficiency?

I need the answer on student ID K210443