Problem 1 32 points Write the pseudocode and analyze the running time of the following operations when a list of N numbers is represented as (1) array (2) singly linked list (you can assume that you have both head and tail pointers) (a) Find the number at index N-2 (b) Swap the numbers at index i and j (c) Remove the number at index 0 (index 0 cannot be empty after removing) (d) Add a number at index 0 Problem 1 32 points Write the pseudocode and analyze the running time of the following operations when a list of N numbers is represented as (1) array (2) singly linked list (you can assume that you have both head and tail pointers) (a) Find the number at index N-2 (b) Swap the numbers at index i and j (c) Remove the number at index 0 (index 0 cannot be empty after removing) (d) Add a number at index 0