C++

III. PROGRAMMING EXERCISE 1. Modify the application from sample code 3 wherein the parentheses () and MDAS rule will be included in the expression to denote that whatever is placed inside the parentheses should be evaluated first, and that multiplication, division and modulo is to be considered first before addition and subtraction. For instance, Infix notation: 8* (9-5) + ((2 / 5)% 6) Postfix notation: 895-*25/6% + 2. Write a program that uses a stack to convert a binary number into any preferred equivalent base number (range from base 3 up to base 16). 3. Create a file named StackOfWords.txt that contains 15 five-letter words of your own choices separated each by a new line and are arranged alphabetically. Continue by doing a program that will insert a word from the file to the stack if there are more than two vowels present in each word. Display the words placed inside the stack in alphabetical manner