Need this Urgent. FInal answer is enough. 3. What would be the three main actions that occur during each second of simulated time in the car wash simulation? Group of answer choices 1. Sometimes add a new customer to the arrivals queue. 2. Start a new car through the washer when a car in washer finishes the washing.. 3. Tell the washer that another second has passed. 1. At any secone add maximun of two new customers to the arrivals queue. 2. Sometimes start a new car through the washer. 3. Tell the washer that another second has passed. 1. Sometimes add a new customer to the arrivals queue. 2. Sometimes start a new car through the washer. 3. Check the washer what time is it now. 1. Sometimes add a new customer to the arrivals queue. 2. Sometimes start a new car through the washer. 3. Tell the washer that another second has passed. 1. At any secone add maximun of two new customers to the arrivals queue. 2. Start a new car through the washer when a car in washer finishes the washing.. 3. Check the washer what time is it now.. Question 6 What statement is the most appropriate? Group of answer choices A queue can be used to buffer data in a LIFO fashion that is being sent from a fast computer component to a slower component. A queue can be used to buffer data in a LIFO fashion that is being sent from a slower computer component to a quicker component. A queue can be used to buffer data in a FIFO fashionthat is being sent from a fast computer component to a slower component. A queue can be used to buffer data in a LIFO fashion that is being sent from any computer component to any other components. A queue can be used to buffer data in a FIFO fashion that is being sent from a slower computer component to a quicker component. Flag question: Question 7 The following f1 function is a new constant member function of the queue class in section 8.3. template <class Item> Item queue<Item>::f1( ) const { assert(size( ) > 0); return data[last]; } What is the best statement about f1 function? Group of answer choices It returns a copy of the item at the rear of the queue and is for the linked-list version of the queue. It returns a copy of the next item of the queue and is for the array version of the queue. It returns a copy of the item at the rear of the queue and is for the array version of the queue. . It returns a copy of the item at the front of the queue and is for the array version of the queue. It returns a copy of the next item of the queue and is for the linked-list version of the queue. Question 13 What is the output produced by the function call exercise(4), for the following definition? void exercise(int n) { cout << n << endl; if (n > 1) exercise(n-1); cout << n << endl; } Group of answer choices 4 3 2 1 1 1 1 1 4 3 2 1 4 3 2 1 4 3 2 1 4 3 2 1 1 2 3 4 1 2 3 4 Flag question: Question 14 What is the best description of f1 function? unsigned int f1(unsigned int n) { if (n == 1) return 1; else return f1(n-1)+(2*n - 1); } Group of answer choices The.