Help with C++

16.10 Homework 6a Shunting Yard Stacks and Queues are data structures that organize the storage and retrieval of items. A stack is a Last-In-First-Out (LIFO) data structure, like a stack of plates on a table, while a queue is First-In-First-Out (FIFO), like a line at a movie theater. Both of these structures are used extensively in many contexts. This assignment will give you some experience working with these two data structures. Related HackerRank Problems o C++->Introduction-> variable-sized-arrays o Data Structures -> Stacks->Balanced Brackets o Data Structures->Queues->Truck Tour Problem 6a:Shunting Yard Algorithm The "Shunting yard" algorithm (https://en.wikipedia.org/wiki/Shunting-yard_algorithm) is a stack-based method to convert an in-fix expression such as 3+4)* 12 2 to postfix 3 4 12* 2 . The algorithm relies on a stack of operators (+-18) to work. A simplified version of the algorithm can be stated as follows