[solved]-Write Efficient Pseudocode Implementation Following Function Prototypes Proper C Code Also Q39059935

Write an (efficient) pseudocode for the implementation of eachof the following function prototypes (proper C code will also beaccepted)

– void print(Q) – prints the entire queue Q from front toback.

– int enqueue(Q,x) – enqueues the element x into queue Q (ifunsuccessful, return -1)

– int* dequeue(Q) – dequeues the next integer from front of thequeue (if unsuccessful, return null)

– int isEmpty(Q) – returns 1 (true) or 0 (false) depending onemptiness of the queue Q

– unsigned int size(Q) – returns the number of items currentlyin the queue

In your final solution, you may add any extra attributes thatyou feel is needed for this question but you must use as few extraattributes as possible and your algorithm must be as efficient aspossible (in terms of big-O analysis).

Expert Answer

---

Answer to Write an (efficient) pseudocode for the implementation of each of the following function prototypes (proper C code will … . . .