a. If the operating system allocates a run-time stack of static size, analyze the effects of this strategy on execution of recursive functions. b. Investigate why functions returning length of arrays and lists are O(1) in time. Investigate the time complexity of the best and worst case of the given code fragment. (Identify all worst and best cases. Explain your view thoroughly to earn marks.) def enqueue (self, pri, item): new = [pri, item] if self.isEmpty(): self.q.append(new) return if pri >= self.highest(): self.q.append(new) return if pri