you will write a program to solve linear equations given in upper triangular form. There are N equations, and N unknowns. This is equavalent to the following matrix multiplication [A][X]=[B], where A is a square matrix (N by N), X and B are vectors with size N.
First, find the last unknown (Xn ) in the last equation.
Then substitute its value in the equation just above it and find Xn-1 .
Repeat back substitution until all X's are found.
Your program should dynamically allocate memory for the data structures.
please help me with my homework because i have failed to write anything.