Write a quick sort() method for the SortableLinked List class from Section 8.5. Your method must take time in Θ(n log n) on average and in Θ(n 2 ) in the worst case. (Hint: Keep track of nodes rather...

Write a quick sort() method for the SortableLinked List class from Section 8.5. Your method must take time in Θ(n log n) on average and in Θ(n²
) in the worst case. (Hint: Keep track of nodes rather than indices. When you need to swap two values, use get Item() and set Item() to change the contents of the nodes rather than moving the nodes. Think about how you might specify a region of a linked list.)