Design aDesign a queue abstract data type for float elements in a language that you know, including operations for enqueue, dequeue, and empty. The dequeue operation removes the element and returns its value.

Check the explanation

Explanation:

Due to difficulty in submitting the code on the text editor, it has been written and uploaded, check the below attached image that shows the designed queue abstract data type (which is defined by the following operations and structure, when a queue is structured, as expressed in the above statement, as an prepared or structured item collection which are added at one end, that is often called the “rear,” and detached from the other end, called the “front.”) for float elements.