a) A a) An array A[1..n) of integers is said to have a god element if more than half of its entries are the same. Given an array, design an efficient algorithm pseudocode to tell whether the array has a god element, and, if so, find the element. What is the complexity of your algorithm ? b) Design a special stack (SS), the special stack (SS) does the usual push' and 'pop' in constant times. In addition, it must find the minimum value of elements currently in the stack in constant time (find-min operation). You are free to use any auxiliary structures. c) How will you describe the below recurrence relation T in closed form? Explain. T(n) = T((7/Tt) n2) +3, when n> 2 T(n) = 1, otherwise