What value is stored in num3 after the following pseudocode, where num1, num2, and num3 are integer variables and aQueue is a standard queue?

C++ Consider the following function as a property of a LinkedBag that contains a Doubly Linked List.  Assume a Node has pointers prev and next, which can be read and changed with the standard get and set methods.   Assume that the doubly linked list is: 1 <--> 2 <--> 3 <--> 4 <--> 5 <-->6 If you are uncertain what the above diagram depicts, it is a doubly linked list such that: The head of this doubly linked list is the node that contains the value 1. The tail of this doubly linked list is the node that contains the value 6. The 3rd node in this list contains the value 3. The contents of this list are the values 1 through 6 in sequential order. The following questions are regarding the linked list after after the test_function is run. A. The head of the list after the test_function is run contains the value:      B. The tail of the list after the test_function is run contains the value:       C. The 3rd node in the list after the test_function is run…

// FILE: DPQueue.h// CLASS PROVIDED: p_queue (priority queue ADT)//// TYPEDEFS and MEMBER CONSTANTS for the p_queue class://   typedef _____ value_type//     p_queue::value_type is the data type of the items in//     the p_queue. It may be any of the C++ built-in types//     (int, char, etc.), or a class with a default constructor, a//     copy constructor, an assignment operator, and a less-than//     operator forming a strict weak ordering.////   typedef _____ size_type//     p_queue::size_type is the data type considered best-suited//     for any variable meant for counting and sizing (as well as//     array-indexing) purposes; e.g.: it is the data type for a//     variable representing how many items are in the p_queue.//     It is also the data type of the priority associated with//     each item in the p_queue////   static const size_type DEFAULT_CAPACITY = _____//    p_queue::DEFAULT_CAPACITY is the default initial capacity of a//    p_queue that is created by the default…

Write a menu-driven C++ program to manage your college course history and plans, named as you wish. It should work something like this:  Array size: 0, capacity: 2MENUA Add a courseL List all coursesC Arrange by courseY arrange by YearU arrange by UnitsG arrange by GradeQ Quit...your choice: a[ENTER]Enter a courses' name: Comsc-165[ENTER]Enter the year for Comsc-165 [like 2020]: 2016[ENTER]Enter the units for Comsc-165 [0, 1, 2,...]: 4[ENTER]Enter the grade for Comsc-165 [A, B,..., X if still in progress or planned]: x[ENTER]Array size: 1, capacity: 2MENUA Add a courseL List all coursesC Arrange by courseY arrange by YearU arrange by UnitsG arrange by GradeQ Quit...your choice: a[ENTER]Enter a courses' name: Comsc-110[ENTER]Enter the year for Comsc-110 [like 2020]: 2015[ENTER]Enter the units for Comsc-110 [0, 1, 2,...]: 4[ENTER]Enter the grade for Comsc-110 [A, B,..., X if still in progress or planned]: A[ENTER]Array size: 2, capacity: 2MENUA Add a courseL List all coursesC Arrange by…