Consider the following code using book queue implementation. What is the output of the code? int main() { } O A. queueType queue; int x, y; x = 10; y = 20; queue. addQueue (x); queue. addQueue (y); x = queue.front (); queue.deleteQueue (); queue. addQueue (x + 5); queue. addQueue (25); queue.deleteQueue (); queue. addQueue (x + y); queue. addQueue (y - 5); while (!queue.isEmptyQueue ()) { cout < < queue.front () < < " "; queue. deleteQueue (); } cout < < endl; return 0; 15 20 25 30 OB. 10 20 25 15 30 O C. O D. 15 25 30 15 10 20 15 25 30 15