Given a Queue with elements $A,B,C,D,E,F$ : Left$/$Front $A,B,C,D,E,F$

Applied Operations in order: Enqueue$($Z$),$ Enqueue$($X$),$ Dequeue$(),$ Enqueue$($Peek$($O$),$ Enqueue$($Dequeue$())$

Given the above case, what is the final Queue?

a$.B,C,D,E,F,Z,B$

b$.C,D,E,F,Z,x,B,B$

c$.C,D,E,F,Z,x,B$

d$.C,D,E,F,Z,x,x,B$

Which of the following is correct in general?

a$.$ Array$-$List involves fewer element movements than Linked$-$List, when removing an element.

b$.$ Array$-$List involves more element movements than Linked$-$List, when inserting an element.

c$.$ Array$-$List involves more element movements than Linked$-$List, when getting an element.

d$.$ None of the other answers

Which of the following structures allow reading the structure's last element directly in a single operation?

a$.$ None of the other answers

b$.$ Stack and Queue

c$.$ Queue and List

d$.$ List and Stack