please solve this

Question 40 points Implement such and solutions to the following problem faciting poufix exprentices informing fireprosto por experi We are providing emple code drie public balancing main method to check whether an expressiver le balanced infixapotfix.cpp main method to transform an inflix expression into postfix input balanced.txt test cases for balancing app Input Intiapostitut test call for inflixtopostfix.cpp input portavalt tercare for postalapp portal.cpp main method to evaluate postfix expression stack implementation stack hpp stack header file wake Temple, un ge+stack.cpp lalancing opp + stack app portfival.cpp 58++ stack app infitopoutfix.cpp To reach program, a.out The follow this fomutepected solution input. Gives input your job is to implement code that the expected solution. Only, you need to be expected solution, pris halip mobile del rendely descono) . While we vide a low cases, you repted to more to make sure your code words Question 1 (20 points) Use a recursion tree to determike a good asymptotic upper bound on the recurrence T(n) = 3T(n/3) + n. Use the substitution method to verify your