(Solved): Problem QuickSort. Implement in either Java or Python the pseudocode given in figure 1.8 in the ...

Problem QuickSort. Implement in either Java or Python the pseudocode given in figure 1.8 in the textbook (p. 29). To receive credit, your program must implement the code that is there; in other words, submitting an implementation of quick sort that does not follow that pseudocode will receive zero points. Write the program in three parts: - The quicksort method - The partition method - A main method or section that: - Reads in the input data from standard input. The input will consist of an integer indicating the size of the array and then the integer entries in the array. For example, input formatted like this would indicate an array of size 7 with the given values: 756281422424354 - Calls the quicksort method on this array - Checks that the array is sorted with a loop that checks to see that each element is less than or equal to the one just after it. - Prints "Sorted" if the array passes the above check and "Didn't work" otherwise.