1. Suppose that we have a stack of characters, denoted by S, and a queue of characters, denoted by Q. We also assume that we execute the following code for each data structure separately: Insert(a);Insert(b);Insert(c);x=Delete0;Insert(d);y=Delete0;z=Delcte; What are the valucs of x,y, and z for each data structure S and Q. respectively? Please show the intermediate steps