Assume you are asked to implement the queue as a circular linked list with two pointers front and rear. Which queue operation does the following function represent? void function(Node*front, Node*rear, Node*n) { rear->next=n; n->next = front; rear=n; QUEUE operations as Pop, Push, Front... Select one: a. Push operation with cost depends on LinkedList size b. Push operation with cost does not depend on LinkedList size C. Front Operation with cost does not depend on LinkedList size d. Pop operation with cost does not depend on LinkedList size