P7. (9 pts) Assume that a FIFO Queue is implemented using an array of size 3. Show the array after each of the operations below put(3) put(5) getO put(1) geto put(2) empty 35 2 Write the code that shows how to updated the start element in the queue index variable what points to the first P8 (10 pts) Assume that insert_node (L1, tmp) inserts node tmp after node L1. int main() link L1; link tmp; L1new list tmp new-link ( 34 , NULL); insert_node (L1, tmp); tmp new_link (9, NULL); insert_node (L1, tmp) // where insert_node (L1,tmp) inserts node tmp after node L1 a) (5 pts) Draw ALL the data that exists in the program at time T1. Show all variables as boxes and write the data in them. Show memory addresses as well. Draw to the right of the code b) (5 pts) Assuming a memory address is 8 Bytes, and int is 4 Bytes, a char is 1 Byte and a Double is 6 Bytes, give the total memory used (as number of Bytes) in main (by time