1.1 You have an empty stack in which you perform the following sequence of operations: push ("customer 1") push ("customer 2") pop() push ("customer 3") peek() provide a visual description of the stack for operation performed on the stack (5 Marks) 1.2 Describe a recursive algorithm to compute the integer part of the base-two logarithm of n using only addition and integer division by writing the code in python. (5 Marks) 1.3 Write a function that calculates the average of an array by computing every element of an array A separately. (5 Marks) Question 2 Below are some computational tasks. For each one of these tasks, choose the data structure or abstract data type you feel is best suited to perform the task from the following list: Stack, Queue, Hashtable, AVL Tree, Priority Queue. In addition, list the basic operations for the data structure or ADT that you chose and give asymptotic worst-case running times for those operations. No additional explanation is required