7. (5 points) The following function converts a prefix expression to an infix expression assuming the expression can only contain unsigned integer numbers and and operators. 1. public static String seaver String prefix) { 2. Stacks - new astack string>; 3. String operandi, operand2, intix; iai - Rexioength-1, 5. whites > 0) char Dexte - Defix shardt (3) 7. if (texte Ww (nexos --'-' operandi = SARORO); operand2 = SUBAD(; infix = '/' + operandl + dexte + operand2 + ''; 10. S. Bush, (infix); i--; 11. } 12. else if (Shaxastanisliga (ex.ch { 13. int end - 14. while(Character digit (Reebis shacht (a)) 15. in = RESfixaubstring(i+1, end+1); 16. Subash (infix) 17. 1 18. else -- 19. } 20. return RARO1 ti (a) (2.5 points) Rewrite only the lines of code that need to be changed so that the above function converts a prefix expression to a postfix expression. () (2.5 points) Describe in words what changes are needed on the above given spaventa function so that it also finds the value of the converted prefix expression