the alternative implementation of the queue adt is to use list such that the rear of the queue is at the end of the list what would this mean for big- performance what is the result of carrying out both steps of the linked list add method in reverse orderwhat kind of reference resultswhat types of problems may result explain how the linked list remove method works when the item to be removed is in the last node explain how the remove method works when the item is in the only node in the linked list programming exercises modify the infix-to-postfix algorithm so that it can handle errors modify the postfix evaluation algorithm so that it can handle errors implement direct infix evaluator that combines the functionality of infix-to-postfix conversion and the postfix evaluation algorithm your evaluator should process infix tokens from left to right and use two stacksone for operators and one for operandsto perform the evaluation turn your direct infix evaluator from the previous problem into calculator implement the queue adtusing list such that the rear of the queue is at the end of the list design and implement an experiment to do benchmark comparisons of the two queue implementations what can you learn from such an experiment it is possible to implement queue such that both enqueue and dequeue have ( performance on average in this case it means that most of the time enqueue and dequeue will be ( except in one particular circumstance where dequeue will be ( consider real life situation formulate question and then design simulation that can help to answer it possible situations includecars lined up at car wash customers at grocery store check-out airplanes taking off and landing on runway bank teller be sure to state any assumptions that you make and provide any probabilistic data that must be considered as part of the scenario programming exercises