$1.$Prepare a program that can duplicate lines using the methods of circular array implementation of queues. A change of methods is needed so that keeping the front of the queue always in the first position of a linear array $($doubledisp$2.$cpp$).$

$*$ Use the book for this book, we already have the program

Hint: a$.$ the Node structure will be used.

b$.$ the Queue class will be developed using the circular implementation $($p$89)$

c$.$ the Queue methods will be adjusted by ignoring the front protected variable.

d$.$ each line will contain at most $10$ characters. $($p$91,$ E$4)$