Is it possible to use heap sort, selection sort, bubble sort, and/or insertion sort on a doubly-linked list such that the runtime is the same as the runtime if we were to perform these sorting algorithms on an array? Also, we should only be using a constant additional amount of memory (for example, the amount of pointers should be fixed). Explain your reasoning for each sorting algorithm. For the sake of the problem, all nodes are available to you, meaning there can we a pointer to a node in the middle of the list.