Problem#1 C++: Modify the code of Figure 4.18 to support storing variable-length strings of at most 255 characters. The stack array should have type char. A string is represented by a series of characters (one character per stack element), with the length of the string stored in the stack element immediately above the string itself, as illustrated by the figure below. The code should accept an input string from, {,},(,),[,] and whether the pairs and the orders of {,},(,),[,] are correct in exp. For example, the program should print true for exp = [()]{}{[()()]()} and false for exp = [(])

Note: Please post the output of this as well as the source code!!!THANK YOU VERY MUCH!!

*************************************************************************************************************Figure 4.18 is below.

\begin{tabular}{l|l|l|l|l|l|l|l|l|l} \hline[ & ( & ) & \{ & \} & \{ & {[} & ] & 8 & \\ \hline 0 & 1 & 2 & 3 & 4 & 5 & 6 & 7 & 8 & Top =8 \end{tabular} Figure 4.18 Array-based stack class implementation