PYTHON - Computational Complexity (Time Complexity) of a simple function using Time or Timer Module

1. Show the computational complexity of this function by using Time or Timer module.

class Queue: def _init__(self): self.items[] self.frontIdx0 ef _compress (self): for i in range(self.frontIdx, len (self.items)) newlst.append (self.items [i]) self.items newlst self.frontIdx0 def dequeue(self): first self.items [0] del self.items [0] return first def enqueue(self,item): self.items.append (item) def front(self): if self.isEmpty(): raise RuntimeError("Attempt to access front of empty queue") return self.items [self.frontIdx] def isEmpty(self): return self. front1dx en(self. items) def transpose_queue (input): outputQueue() rows_count-len (input) columns_count-len(input [0]) for i in range(columns_count): t row [ for row in input: qQueue () q.itemsrow t_row.append (q.dequeue()) output.enqueue(t_row) return output