Consider ONLY the following queue_node declaration and figure when answering this question class queue_node { public: int data; queue_node *prev, *next; }; back data If the queue contains one node, and the queue is CIRCULAR, what are the prev and next helds equal to? O None back front prev and next next prev 0