Write a C++ program that reads string expressions from an input file "prefix.txt" containing prefix expressions (one expression per input line). For each prefix expression read from the input file, the program should: (1) convert the expression to a fully parenthesized infix expression and (2) find the value of the expression. Use a stack to solve the problem. Assume the expressions contain only integer numbers and the *, /, +, - operators. Generate the results in an output file "results.txt" in the form of a table with 3 columns as shown in the example below. Example of an input file "prefix.txt": + 5 * 10 2/*32 - 74 The obtained "results.txt" output file for the above example of input file