Part 1: Basic Queue. Using C++ Standard Template Library (STL) Discussion (requirement for STL): 1. #include 2. Operations on queue q: a. q.empty() - test if queue is empty b. q.size() - how many items are queue C. q.push(t) push t of type T onto the top of the queue d. q.pop() - pop the front item off the queue e. q.front() - get the front item from the queue f. q.back() - get the back item from the queue g. q.front() = expression -set/change the item at front h. q.back() = expression -set/change the item at back Copy and paste the following program in your IDE, inspect the output and do the exercise. #include #include using namespace std; int main() { queue int> q; q.push(1); q.push(2); q.push (3); q.push(4); cout