Review the resource$($s$)$ on constructing flowcharts and solve the following:

An algorithm is said to be recursive if at some point the algorithm refers to itself as a

step in the process. This creates a nested loop structure that is only broken when the

inner$-$most process is complete. Gaussian elimination can be described as a recursive

algorithm, taking as its input a smaller and smaller system of equations until just one

equation and one variable remains. Construct a flowchart depicting the solution of an

$n-$variable system using recursive Gaussian elimination with back$-$substitution.