Question 1: Convert the following infix expression into postfix one: (A+B^D)/(D-F)+G PS: you have to illustrate the different steps of this conversion one by one. Token #Scan Postfix Expression Stack 1 2 3 4 15 6. 17 18 9 10 11 12 13 14 15 The final solution is: .... ... Question 2: Evaluate the postfix expression A B C D+ * / Where A = 66, B = 1, C = 12 and D=10 %3D

Problem Description: Implement the described Mancala variant in C++ in the pictures. Player 1 will be a human while the other will be a computer player. The computer player selects a hole following the following decision logic: If there is a hole with enough pieces to finish the turn in the computer player's end zone, select it. Otherwise select the hole on the right to left path with the greatest amount of marbles. If there are no marbles on that path then select the hole closest to the opponent's end zone. It is highly suggested, but not required, to pause the output after the computer makes a move to allow the user to interpret the output before more gets printed out. Look into cin.get(); The program should not allow the player to enter incorrect selections. The player cannot select a nonexistent hole, the end zones, or an empty hole. Look at the example output for an example for how to output the game board formatted in a nice way. You must tell the player what input is valid. For…

6. Explain the number of times the inner for-loop body executes. for (int counter1 0; counter1 < 7; counter1++) %D { for(int counter2 0; counter2 < 8; counter2++) { // inner loop body } }

Need help with this c++ code