Can anyone help using octave for this pseudocode plz? Thank you

1-1 Here, we have used the formula for the sum of a geometric that is, j-1 Letting aij = (1 + iy-1 and bi-| ( l + i)"-1 1/i in Equatio Ax = b. EXAMPLE1 We write a pseudocode for a specific test case that solves th various values of n. Solution Since the naive Gaussian elimination procedure Naive Gauss is a calling program. We decide to use n = 4, 5, 6, 7, 8, 9, 10 pseudocode: program Test NGE integer parameter m 4-10 integer i. j,n; real array, (ai)iumxlam, (bim im for n = 4 to 10 for i = 1 to n for j= l to n da+D Pseudocode end for end for call Naive Gauss(n, (a,). (b). (x,) output n, (x end for end program Test NGE When this pseudocode was run on a machine that carries ap digits of accuracy, the solution was obtained with near full preci then the computed solution was worthless because one compone 1-1 Here, we have used the formula for the sum of a geometric that is, j-1 Letting aij = (1 + iy-1 and bi-| ( l + i)"-1 1/i in Equatio Ax = b. EXAMPLE1 We write a pseudocode for a specific test case that solves th various values of n. Solution Since the naive Gaussian elimination procedure Naive Gauss is a calling program. We decide to use n = 4, 5, 6, 7, 8, 9, 10 pseudocode: program Test NGE integer parameter m 4-10 integer i. j,n; real array, (ai)iumxlam, (bim im for n = 4 to 10 for i = 1 to n for j= l to n da+D Pseudocode end for end for call Naive Gauss(n, (a,). (b). (x,) output n, (x end for end program Test NGE When this pseudocode was run on a machine that carries ap digits of accuracy, the solution was obtained with near full preci then the computed solution was worthless because one compone