Atwo part circular linked chain implementation of a queue
a. all other answers
b. keep nodes that are deallocated for future use
c. allocates newnode on demand when there are no available nodes
d. is intialized with ni available nodes

A) All other answers

Explanation:

Circular linked chain is the type of the linked list formed that has the first component attached to the last component and every other are connected consecutively .

The circular linked list which is in two section is implemented in the form queue by the methods such as the initializing the nodes and using them when there is the requirement of it or it can also keep the node for the future use.