Need help figuring these out, not finding any resources online...

1)

A) In the implementation of insertion sort given in class, an array is used to hold the data. What would be the impact on performance if the algorithm had to use a doubly linked list instead? Explain. You may not convert the list into an array. (Hint: although it is not required, it may be useful to give pseudocode in your answer.)

B) Does the performance (Big-Oh) of mergesort change depending on the sorted/unsorted nature of the input? Explain.