Can anyone help me write a procedure for Maple 15 that does the following:

INPUT: number of unknowns and equations n; augmented matrix A=[aij], where 1<=i<=n and 1<=j<=n+1.
OUTPUT: solution x[1], x[2], ... , x[n] or message that the linear system has no unique solution.

Step 1: For i=1,...,n-1 do steps 2-4.  # Elimination process.

Step 2: Let p be the smallest integer with i<=p<=n and A[p,i]≠0.
          ...

I want to write a code to generate Legendre Polynomials using the Gram-Schmidt Process. I have no experience with programing. Here is how the process should work:

Given "(f) = {f[0]=1, f[1]=x , f[2]=x^(2) , f[3]=x^(3) , ... , f[n]=x^(n)} "
       
Find the Legendre Polynomials: "{P[0] , P[1] , P[2] , P[3] , ... , P[n]}"

First,  P[0]=f[0]=1

then, the rest are defined recursively by

P[1]=f[1]-(()/())*P[0] = x