Goals implement linear data structures using stl containers in this lab, we will create two data structures using stl containers: “stack” and “queue”. requirements note: “deque” stl container is not allowed, for the simplicity for graders. queue queue is a first-in-first-out (fifo) data structure. for the queue container, we will implement a program that simulates a buffer. the simulation needs a function that randomly generate number. and the buffer simulation starts with no value in the buffer. at the start of simulation, the menu should ask user: how many rounds will be simulated. the percentage chance to put a randomly generated number at the end of buffer. the percentage chance to take out a randomly generated number at the front of buffer. note: for all the percentages, the “%” character is not required from user inputs. for example, if user input 25, it means 25%, and the number “25” is stored in the variable, not “25%”, or “0.25”.