Describe in pseudocode an O(n) time algorithm to reverse an Array, an O(n) time algorithm to reverse a Single Linked List, and an O(1) time algorithm to reverse a Double Linked List. Assume all containers have n elements. (b) For each of the above abstract data type, is there a faster algorithm? Please follow the definition of all sequence containers as described in class.