notes queue operations in pseudo-codeenqueue(qxq[tail[ ]< if tail[qlength[qthen tail[ < else tail[ <tail[ dequeue(qx < [head[ ]if head[qlength[qthen head[ < else head[ <head[ return these are also ( time operations figure shows the operations on queue figure operations on queue frontrear (aempty queue front rear (ba inserted front rear (cbc inserted front rear (da deleted front rear (eb deleted front rear (fd inserted lovely professional university