The given code fragment is in python.

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