2) [15 points] Queues In this question you may assume that the functions below are implemented You cannot make assumptions about how the queue is implemented If you want to use any other function, you need to implement it. // creates a new queue queue_t* queue_create ): // enqueue a given item to the queue void enqueue (queue_t* q, int item); // remove from the gqueue, and return the removed value /7 Pre condition: queue is not empty int dequeue (queue t* q)i /7 checks if the queue is empty bool queue_is_empty (queue_t* q); // frees the queue void queue free (queue t* a) [12 points] Write a function that creates a copy of a queue, i.e., it gets a queue and creates another queue with the same elements in the same order In the end on the function, the original queue must be returned to its initial state //returns a copy of orig queue_t* queuecopy (queue_t* orig)i [3 points] What is the running time of your function