Implement a queue with a linked list and run a list of operations on it. ops[i] is one of "enqueue" (add args[i] at the back), "dequeue" (remove and report the front item, or −1 if empty), "front" (report the front item, or −1), "isEmpty" (1 or 0) and "size". Return everything reported, in order. A linked listLinked ListA chain of nodes where each node stores a value and a pointer to the next node. grows one node at a time, so the queue never fills up and nothing is ever shifted. The front is easy to reach through head; the back is the interesting part. Keeping a tail pointerTail PointerA pointer to the last node of a linked list, allowing O(1) insertion at the end. alongside head turns enqueue from an O(n) walk into an O(1) link.