Write a c code that solve the maze problem using a stack...

Transcript

00:01 Hello student here two problems are given first a first b second a second b so here the first problem is we have to create an auxiliary stack so that we can put the element of the stack into it and then put back so here auxiliary set bottom element to i so here we are passing stack and i so auxiliary stack is built and this is empty at the starting while not stack empty do so now we have a stack so from this stack we will pop the elements this is the existing stack this this is the existing stack and auxiliary stack we have built and auxiliary stack we have built now this is auxiliary so what we are doing we are pop this element from this given stack and now push the element into the auxiliary stack so after when the element come into the auxiliary stack we then push the element we are pushing the element into the auxiliary stack after this the elements will be there and it will be complete empty what we have to do now pop the element now after this we have to pop the element first we are applying pop here and here push and after this we have to do the pop operation so in this way this procedure set bottom element to i so i will be point to the last one at the bottom when we pop out so this is the procedure for this and now for the first b what i am doing here we have to find we have to here take the third element use the operation push pop pick and empty to construct an operation which sets i to the third element from the bottom of the stack so from the bottom of the stack so suppose this is the stack and this is the bottom so from the bottom this this element i will be here so here first i will check if the elements are less than 3 or not if the element will be less than 3 then i can't reach towards the third element so the here value error message will be raised and the stack must have at least 3 element and if after this third element i have to take from the last that's why third is subtracted from the stack size now i in the range stack size minus 1 0 comma minus 1 so here for i in the range in the range function what i am applying starting is from stack size minus 1 after this 0 and after this i have to reach towards the decrement because i am starting from the upper position so i am doing operation from the upper positions so here with the help of a minus 1 minus 1 i will reach towards the third element and i have to do this operation when i will reach towards the zeroth so here what we i am doing i am positioning i am changing the position i am shifting the element so in this way i am shifting the j minus 1 element to the jth position and now the time will come when the stack of 0 will point to the third element so we will put the third element at the…

Question

Write a C++ Code that solve the MAZE problem using a STACK PLUS other necessary data structures.

Question

Write a C++ Code that solve the MAZE problem using a STACK PLUS other necessary data structures.

Please give Ace some feedback