The pseudocode of an algorithm is given below:

Answer and give explanations for the following:

1. What is the worst-case time complexity if a singly linked list was used?

2. What if the list were a static array?

fcn bubbleSort (list, size): repeat swapped = false repeat with i from 1 to size: if (list at i-1 > list at i): swap (i-1, i) of list swapped true until swapped swapped = false