LL with head, dummy node, is easier to implement. Study the Python code and add add$-$node$/$pop$-$node code functions named as qAdd and qPop so that to add to the end of the queue and pop will remove from the head node but updates the head node to point to the new first node. Submit Python code.

Python $3\mathrm{.}6$Edit Code & Get AI Helpline that just executednext line to executeDone running $(18$ steps$)$Visualized with pythontutor.com