This function is written in JavaScript.

4 Sorting Quicksort Implement an iterative (no recursive calls) version of quicksort. The prototype of the function must be the same as in the lecture: function quicksort(list); You may start from the implementation given in the lectures. Test your code to make sure that it works as intended. You may, but do not need to, submit your test code in addition to your implementation of quicksort. Analyse the time and space complexity of your implementation and give a bound for its worst-case runtime and memory usage. Total 13 points