c. 6 new = 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): [pri, item] if self.isEmpty() : self.q.append (new) return if pri >= self.highest () : self.q.append (new) return if pri