c language !!!

2. Queues ( 10 points) Draw a sequence of diagrams, one for each problem segment, that represent the current state of the queue after each labeled set of operations. If an operation or instruction produces output then indicate what that output is. We will use the function enqueue to add to the queue and serve to remove from the queue. hQueue is the handle of a quueue opaque object that can hold characters. There is no diagram for init or destroy, hqueue = quete_init_default (); i. queue_enqueue (hQueue, 'a'); ii. queue_enqueue (hQueue, ' b ') ; iii. printf ("%c, " queue front(hqueue)); queue_enqueue (hqueue, 'c'); iv. printf ("\%c", queue_front(hqueue)); queue_enqueue(hqueue, 'd'); v. queue_serve (hQueue); queue_serve (hQueue); vi. printf("\%c", queue_front(hQueue)); queue_enqueue (hQueue, 'e? ); vii. queue_serve (hqueue); queue_serve(hqueue); hQueue destroy (khQuete)