SMA3013 LINEAR ALGEBRA

SEMESTER 1 2020/2021
 CHAPTER 2
 

SYSTEM OF LINEAR
EQUATIONS
2.1 Introduction to System of Linear Equations

Recall that the general equation of a line in two-dimensional space

has the form
, are constants.

This is a linear equation in two variables x and y. Similarly, the

equation of a plane in three-dimensional space has the form

, are constants.

This is a linear equation in three variables x, y and z. In general, a

linear equation in n variables is defined as follows
2.1 Introduction to System of Linear Equations
Definition (Linear Equations in n variables)
A linear equation in the n variables x1, x2, …, xn is an equation that can
be written in the form
a1 x1  a2 x2  ...  an xn  b
Where the coefficients a1, a2, …, an are real numbers and the constant
term b is a real number. The number a1 is the leading coefficient, and
x1 is the leading variables.

Linear equations have no products or roots of variables and no

variables involved in trigonometric, exponential, or logarithmic
functions. Variables appear only to the first power.
 2.1 Introduction to System of Linear Equations
Example.

Each equation is linear.

i.

ii

iii.

iv.
 2.1 Introduction to System of Linear Equations (cont.)

Example.
Linear equations do
Each equation is not linear. not contain products,
reciprocals, or other
functions of the
(i ) xy  2 z  1 variables.

(ii ) x12  x23  3

x
(iii ) z 3
y

  
(iv) 2x  y  sin  z  1
4 5 

(v ) sin x1  3x2  2 x3  0
2.1 Introduction to System of Linear Equations (cont.)

Solution
A solution of a linear equation in n variables is a sequence of n real
numbers arranged to satisfy the equation when you substitute the
values

into the equation

Example
and satisfy the equation . Some other solutions are and ,
and and and .
 SMA3013 LINEAR ALGEBRA SEM 1 2015/2016

2.1 Introduction to System of Linear Equations (cont.)

The set of all solutions of linear equation is called solution
set.
To describe the entire solution set, use a parametric
representation.

Example
Solve the linear equation .

Solution
.
In this form, is free and is not free because its value
depends on the value of . By letting for , we can represent
the solution set as
 SMA3013 LINEAR ALGEBRA SEM 1 2015/2016

2.1 Introduction to System of Linear Equations (cont.)

is any real number.

Or
is any real number.

*For convenient, choose the variables that occur last in the

given equation to be free/independent variables.

Exercise
Solve the linear equation .
2.1 Introduction to System of Linear Equations (cont.)

A system of linear equations is a finite set of linear equations,

each with the same variables.
A solution of a system of linear equations is a vector that is
simultaneously a solution of each equation in the system.
The solution set of a system of linear equations is the set of all
solutions of the system.
2.1 Introduction to System of Linear Equations (cont.)

Example
Consider the system
2x – y = 3
x – 3y = 5

[2,1] is a solution for this system since it is a solution for

both equations.

How about [1,-1] ?

[1,-1] is not a solution of the system since it satisfies only

the first equation.
2.1 Introduction to System of Linear Equations (cont.)

When you are solving systems, you are, graphically, finding

intersections of lines. For two-variable systems, there are then
three possible types of solutions:

Case 1 : unique solution Case 2 : no solution Case 3 : infinitely many solution

Two intersecting lines Two parallel lines Two coincident lines

 2.1 Introduction to System of Linear Equations (cont.)

Definition (Consistent system)

A system of linear equations is called consistent if it has at least
one solution.

A system with no solutions is called inconsistent.

A system of linear equations with real coefficients has either

(a) A unique solution (a consistent system) or
(b) Infinitely many solutions (a consistent system) or
(c) no solutions (an inconsistent system)
2.1 Introduction to System of Linear Equations (cont.)
Example
Solve the following systems of linear equations.
(a) x – y = 1 (b) x – y = 2 (c) x – y = 1
x+y=3 2x – 2y = 4 x–y=3

(a) [2,1] is the only solution for both equations. Therefore, [2,1] is a unique
solution.
(with point of intersection (2,1))

(b) The second equation just twice the first. (the solutions are the solutions of the first
equation alone – namely, the points on the line x – y = 2)
Can be represented parametrically as : [2 + t, t]
Then, this system has infinitely many solutions.

(c) This system has no solutions – no intersection.

(the lines for the equations are parallel )
2.2 Solving a System of Linear Equations

Two linear systems are called equivalent if they have the same solution
sets.
Example

x–y=1 and x–y=1

x+y=3 y=1

This two linear systems are equivalent, since they both have the
unique solution [2,1].
2.2 Solving a System of Linear Equations (cont.)
2.2.1 Solving SLE by using Back-Substitution procedure
Example
Solve the system
x–y–z=2
y + 3z = 5
5z = 10

Starting from the last equation and working backward, we have the
unique solution of the system : [3, -1, 2].

This procedure is called

back substitution.
2.2 Solving a System of Linear Equations (cont.)
Example

Solve the system

x–y–z=2 How can we solve this
3x – 3y + 2z = 16 system?
2x – y + z = 9

Strategy:
-transform the given
system into an equivalent
one, so that it can be
solved easily by back
substitution.
2.2 Solving a System of Linear Equations (cont.)

Linear
system

[ ][ ] [ ]
1 −1 −1 𝑥 2
3 −3 2 𝑦 = 16 Matrix equation
2 −1 1 𝑧 9

Ax = b

1 1 1 2
3 3 2 16 Augmented
Matrix
2 1 1 9
2.2 Solving a System of Linear Equations (cont.)
2.2.2 Gaussian Elimination
Record the coefficients and constant terms into augmented matrix
1 1 1 2
3 3 2 16
2 1 1 9
This ERO
procedure is
called as 1 1 1 2
Gaussian REF form
Elimination
0 1 3 5
0 0 5 10

Solution : [3, -1, 2]

2.2 Solving a System of Linear Equations (cont.)
2.2.2 Gaussian Elimination (cont.)
Gaussian elimination was introduced as a procedure for solving a
system of linear equations.
A process so that when row reduction is applied to the augmented
matrix of a system of linear equations, we can create an
equivalent system that can be solved by back substitution.

Gaussian Elimination
1. Write the augmented matrix of the system of linear equations.
2. Use elementary row operations to reduce the augmented matrix to
row echelon form.
3. Using back substitution, solve the equivalent system that
corresponds to the row-reduced matrix.
 2.2 Solving a System of Linear Equations (cont.)
2.2.2 Gaussian Elimination (cont.)
Example. Solve the system using Gaussian elimination and determine the
type of solution.
i. x – 2y + 3z = 9 ii. y–z=0 iii. x – 3y + z = 1
- x + 3y = -4 x – 3z = -1 2x – y – 2z = 2
2x – 5y + 5z = 17 - x + 3y = 1 x + 2y – 3z = -1
Solution.
i. By using ERO;
R2 + R1

R3 – 2R1

Then, by back-substitution, we have

R3 + R2 Coefficient x = 1; y = -1; z = 2. (unique solution)
matrix in
REF
 2.3 Solving a System of Linear Equations (cont.)
2.3.2 Gaussian Elimination (cont.)
Solution.
ii . By using ERO;
R3 + R1
R2  R1

R3 + (-3)R2

-use a parametric representation.

Let x3 = t
Then,
x1 =-1+ 3t x2 = t.

Then, this system has infinitely many solution.

 2.3 Solving a System of Linear Equations (cont.)
2.3.2 Gaussian Elimination (cont.)
Solution.
iii . By using back-substitution & ERO;

R3 - R1

R2 + (-2)R1

R3 - R2

Then, this system has no solution (inconsistent).

2.2 Solving a System of Linear Equations (cont.)
2.2.3 Gauss-Jordan Elimination

Gauss-Jordan elimination – a procedure similar to Gaussian

Elimination but need to continue the reduction process until a
RREF is obtained.
2.2 Solving a System of Linear Equations (cont.)
2.2.3 Gauss-Jordan Elimination (cont.)
Example
Solve the following systems by using the Gauss-Jordan Elimination.

Solution:

R2 + R1 R3 + R2

R3 + (-2)R1 R1 + (2)R2

Coefficient
R2 + (-3) R3
1/2R3 matrix in
RREF!
R1 + (-9)R3

Then, x = 1; y = -1; z = 2.
2.2 Solving a System of Linear Equations (cont.)
2.2.3 Gauss-Jordan Elimination (cont.)
Example
Solve the following systems by using the Gauss-Jordan Elimination.

x1  x2  x3  3 x1  x2  x3  2 x4 1
a. 2 x1  3 x2  x3  5 2 x1  2 x2  x3  3 x4  3
b.
x1  x2  2 x3  5  x1  x2  x3  3

1 1 0 1 2
1 0 00 0 0 1 1 1
0 1 01 0 0 0 0 0
0 0 12

 x1   2  s  t   2 1   1
x   s  0 1  0 
 2        s t  
 x3   1  t  1  0  1 
         
 x4   t  0  0  1 
 2.2 Solving a System of Linear Equations (cont.)
2.2.3 Gauss-Jordan Elimination (cont.)
Example. Solve the system using Gauss-Jordan elimination and determine
the type of solution.
i. x – 2y + 3z = 9 ii. y–z=0 iii. x – 3y + z = 1
- x + 3y = -4 x – 3z = -1 2x – y – 2z = 2
2x – 5y + 5z = 17 - x + 3y = 1 x + 2y – 3z = -1

Solution. (as previous example)

2.2 Solving a System of Linear Equations (cont.)

Exercise (Gaussian & Gauss Jordan Elimination & type of solution):

1. Find the solution set of the system of linear equations represented by the
the following augmented matrix and determine the type of solution.

 1 1 0 3 1 2 1 0 1 0 2 3
     
( i )  0 1 2 1 ( ii ) 0 0 1 1 ( iii ) 0 1 0 1
0 0 1 1 0 0 0 0  0 0 0 0 
  
1 2 0 1 4 1 1 0 2 1
   
1 0 4 1 5 0 1 2 1 3 0 0 1 1 3 
( iv )   (v )  ( vi )
0 1 0 4 
0 0 0 0 3 

0 1 2
 
0 0 2

0 0 0 1 4  0 0 0 0 0 
1 2 1 0 2 3 2 0 1 1
   
0 1 1 2 3  0 1 1 2 1 0 1 1 4 3
( vii )  ( viii )   ( ix ) 
0 0 1 1 2  2 
  0 0 0 0 0 

0 0 1 1

0 0 0 1 3  0 0 0 0 4 
2.2 Solving a System of Linear Equations (cont.)

Exercise (Gaussian & Gauss Jordan Elimination & type of solution):

2. Solve the system using the Gaussian Elimination and determine the type of
solution.
3 x  5 y  22 x  3 z  2 x  y  5z  3
( i) 3x  4y  4 ( ii ) 3 x  y  2 z  5 ( iii ) x  2z  1
4x  8y  32 2x  2y  z  4 2x  y  z  0

2 x  4 y  5 z  33 x  2 y  6z  5
4 a  12b  7c  20d  22
( iv ) (v ) 4x  y  5 ( vi )  x  y  2 z  3
3 a  9 b  5c  28d  30
2 x  2 y  3 z  19 x  4 y  2z  1

2 a  b  c  2d  6
3x  2 y  3z  8 a  2 b  c  2d  1
3a  4b  d  1
( vii ) x  3 y  6 z  3 ( viii ) ( ix ) a  4b  c  d  1
a  5b  2c  6d  3
2 x  6 y  12 z  6 3 a  5 b  2 c  3d  2
5a  2b  c  d  3

3. Solve the system of linear equation in question (2) by using the Gauss
Jordan Method.
2.2 Solving a System of Linear Equations (cont.)
Exercise (Gaussian & Gauss Jordan Elimination & type of solution):

4. Determine the value(s) of k, if any, will the system have

(a) No solution (b) Unique solution (c) Infinitely many solution

x  ky  1 x  ky  2
( i) ( ii )
kx  y  1 kx  y  4

x  y  kz  1 x  y  kz  3
( iii ) x  yk  z  1 ( iv ) x  yk  z  2
kx  y  z  2 kx  y  z  1
2.2 Solving a System of Linear Equations (cont.)

Exercise (Gaussian & Gauss Jordan Elimination & type of solution)- Answer:

1. ( i ) x 1  2 , x 2  1, x 3  1 unique s olution

( ii ) x 1  1  2t , x 2  t , x 3  1 infinite ly ma ny s olution
( iii ) x 1  3  2t , x 2  1, x 3  t infinite ly ma ny s olution
( iv ) No s olution
( v ) x 1  26 , x 2  13 , x 3  7 , x 4  4 unique s olution
( vi ) x 1  t  5 , x 2  t , x 3  5 , x 4  2 infinite ly ma ny s olution
( vii ) x 1  1, x 2  2 , x 3  1, x 4  3 unique s olution
( viii ) x 1  s , x 2  1  t  2u , x 3  t , x 4  u infinite ly ma ny s olution
( ix ) No s olution
2.2 Solving a System of Linear Equations (cont.)

Exercise (Gaussian & Gauss Jordan Elimination & type of solution)- Answer:

2. ( i ) x  4 , y  2 unique s olution
( ii ) x  4 , y  3 , z  2 unique s olution
( iii ) x  1  2t , y  2  3t , z  t infinite ly ma ny s olution
( iv ) a  100  96t  3s , b  s , c  54  52t , d  t infinite ly ma ny s olution
1
(v ) x   , y  3 , z  4 unique s olution
2
( vi ) No s olution
21 18 15 17
( vii ) x  t  , y   t  , z  t infinite ly ma ny s olution
11 11 11 11
( viii ) a  1, b  0, c  4, d  2 Unique s olution
41 1 17
( ix ) a   t, b   t, c  t  1, d  t infinite ly ma ny s olution
28 28 28

3. Same answer as in Question 2.

2.2 Solving a System of Linear Equations (cont.)

Exercise (Gaussian & Gauss Jordan Elimination & type of solution)- Answer:

4. ( i ) ( a ) No s olution: k  1;
( b ) unique s olution: k  1;
( c ) infinite ly ma ny s olution: k  1
( ii ) ( a ) No s olution: k  1 & k  2 ;
( b ) unique s olution: k  1;
( c ) infinite ly ma ny s olution: k  1,1, 2
( iii ) ( a ) No s olution: k  1;
( b ) unique s olution: k  2 ,1 ;
( c ) infinite ly ma ny s olution: k  2
( iv ) ( a ) No s olution: k  2 ,1 & k  0 ;
( b ) unique s olution: k  2 , 1 ;
( c ) infinite ly ma ny s olution: k  2 ,1,0
 2.2 Solving a System of Linear Equations (cont.)
2.2.4 Cramer’s Rule
Cramer’s rule is a formula that can relate the determinants to the
solution of linear systems and the inverse of the matrix.

Cramer’s rule gives a formula for describing the solution of certain

systems of n linear equations in n variables entirely in terms of
determinants.

Some notations:
For an nxn matrix A & a vector b in Rn,
Column i Where,
Ai(b) denote the matrix
Ai(b) = [ a1 … b … an ] obtained by replacing the
ith column of A by b.
 2.2 Solving a System of Linear Equations (cont.)
2.2.4 Cramer’s Rule
Theorem ( Cramer’s Rule)
Let A be an invertible nxn matrix and let b be a vector in Rn. Then the
unique solution x of the system Ax=b given by

det( Ai (b))
xi  for i  1,... , n
det A

Example

Use Cramer’s Rule to solve the system

x1  2 x2  2
i. ii.
 x1  4 x2  1
2.2 Solving a System of Linear Equations (cont.)
2.2.4 Cramer’s Rule (cont.)
Solution (i) :
Answer(ii):
Compute, X=4/5 ;
2 2 y = -3/2 ;
1 2 det( A1 (b))  6 and z = -8/5
det A   6,
1 4 1 4

1 2
det( A2 (b))  3
1 1
By Cramer’s rule,

det( A1 (b)) 6 det( A2 (b)) 3 1

x1   1 and x2    .
det A 6 det A 6 2
2.2 Solving a System of Linear Equations (cont.)
2.2.4 Cramer’s Rule (cont.)
Notes:

Cramer’s Rule is computationally inefficient for all but small systems of linear
equations because it involves the calculation of many determinants.

To solve the system directly, it would be better if we use Gaussian elimination.

2.3 Solving a System of Linear Equations (cont.)
Exercises (Cramer’s Rule):

1. Solve the following system linear of equations by using the Cramer’s Rule.
x  2y  7 2 x  y  0.1 2x  y  1
( i) ( ii ) ( iii )
2x  y  8 3 x  2 y  1.6 3x  4y  2

3 x  5 y  22 x  3 z  2 2 x  4 y  5 z  33
( iv ) 3x  4y  4 ( v ) 3x  y  2z  5 ( vi ) 4 x  y  5
4 x  8 y  32 2x  2y  z  4 2 x  2 y  3 z  19

2 a  b  c  2d  6
2 x  y  3 z  24 2x  y  3z  3
3a  4b  d  1
( vii ) 2 y  z  14 ( viii ) 4 x  3 y  7 z  5 ( ix )
a  5b  2c  6d  3
7x  5y  6 8 x  9 y  15 z  10
5a  2b  c  d  3

2. Use Cramer’s Rule to solve the system of linear equations for x and y.

kx ( 1  k )y  1
( 1  k )x  ky  3
2.3 Solving a System of Linear Equations (cont.)
Exercises (Cramer’s Rule) - answer:
( i) x  3, y  2
1.
1 1
( ii ) x  ,y 
5 2
6 1
( iii ) x  ,y 
11 11
( iv ) x  4 , y  2
(v ) x  4 , y  3 , z  2
1
( vi ) x   , y  3 , z  4
2
( vii ) x  8 , y  10 , z  6
1 3
( viii ) x  1, y  ,z 
2 2
( ix ) a  1, b  0, c  4, d  2

2. 4k  3 4k  1
x  ,y 
2k  1 2k  1
2.3 Solving a System of Linear Equations (cont.)

Theorem
If A is an invertible nn matrix, then the system of linear equations
given by Ax = b has a unique solution x = A-1b for any b in Rn .
2.3 Solving a System of Linear Equations (cont.)
Example
Use the inverse of the coefficient matrix to solve the linear system
x  2y  3
3 x  4 y  2

Solution:
1 2 
Here we have, A  and .
 3 4 
By theorem, Ax = b has unique solution x = A-1b.
3
Also, b   .
 2 
 2 1   8
Hence, 3
   
x 3 
1      11 
   2 
2 2 2
2.4 The Gauss-Jordan Method for computing the Inverse (cont.)

Exercises (Inverse Matrix – Gauss Jordan Method)

1. Use an inverse matrix to solve each system of linear equations.

x  2y  2 7 x  33 y  1 x  2 y  1
( i) ( ii ) ( iii )
3x  7y  1 4 x  19 y  1 x  2y  3

x  2y  z  1 x  y  2 z  1 x  3 z  2
( iv ) x  2y  z  3 (v ) x  2y  z  2 ( vi ) 3x  y  2z  5
x  2 y  z  3 x y z 0 2x  2y  z  4

2 x  4 y  5 z  33 2 x  y  3 z  24 2x  y  3z  3
( vii ) 4x  y  5 ( viii ) 2 y  z  14 ( ix ) 4x  3 y  7z  5
2 x  2 y  3 z  19 7x  5y  6 8 x  9 y  15 z  10
2.4 The Gauss-Jordan Method for computing the Inverse (cont.)

Exercises (Inverse Matrix – Gauss Jordan Method) – Answer :

( i) x  12, y  5
1.
( ii ) x  14, y  3

( iii ) x  1, y  1

( iv ) x  0, y  1, z  1

(v ) x  1, y  0, z  1

( vi ) x  4 , y  3 , z  2
1
( vii ) x   , y  3 , z  4
2
( viii ) x  8 , y  10 , z  6
1 3
( ix ) x  1, y  ,z 
2 2
2.5 Homogeneous Systems of Linear Equations
Definition (Homogeneous)
A system of linear equations is called homogeneous if the constant
term in each equation is zero.

A homogeneous system has an augmented matrix of the form [A | 0 ].

The following system is homogeneous:

A
homogeneous
2x  3y  z  0 system cannot
have no
x  5 y  2z  0 solution.
2.5 Homogeneous Systems of Linear Equations (cont.)

Example.

Solve the system of linear equations.

2x  3y  z  0
x  5 y  2z  0
Solution.
Applying the Gaussian Elimination, we have
- R2 R1 (-2)R1 + R2

By back substitution; Let z = t,

Then,
y = -3t /13 x = (11/3)t
 2.5 Homogeneous Systems of Linear Equations (cont.)

Theorem
If [ A | 0 ] is a homogeneous system of m linear equations with n
variables, where m<n, then the system has infinitely many solutions.

Proof:
The system is consistent since it has at least the zero solution.
And, rank(A)  m .

By rank theorem:
Number of free variables = n – rank(A)

So, there is at least one free variable and, hence, infinitely many
solutions. 
2.6 The Rank of a Matrix

Definition. (Rank)
The rank of a matrix is the number of nonzero rows in its row
echelon form.

Note:
The rank of matrix A is denoted by rank(A) .

Example:

2 4 1 1 0 1  1 1 2 1 
 0 1 2  0 1 5 0 0 1 3 
     
 0 0 0  0 0 1  0 0 0 0 

Rank 2 Rank 3 Rank 2

 2.6 The Rank of a Matrix (cont.)
Theorem (The Rank Theorem)
Let A be the coefficient matrix of a system of linear equations with
n variables. If the system is consistent, then
number of free variables = n – rank(A)

Example :
Determine the number of the free variables .

1 0 1  1 1 2 1 
2 4 1  0 0 1 3 
 0 1 2  0 1 5
   
   0 0 0 0 
 0 0 0  0 0 1 
4–2
3 – 2 = 1 free variable 3–3
= 2 free variables
= 0 free variable
 2.6 The Rank of a Matrix (cont.)
Exercises:

Find the rank and the number of free variable of the following matrices.

i. iv.

ii.

Answer:
i. Rank = 2 ; free variables = 1
ii. Rank =2; free variables = 1
iii. iii. Rank = 2; free variables = 2
iv. Rank = 5; free variables = 0
Exercises (Homogeneus System of Linear Equation & Rank)

1. Solve the following homogeneous systems of linear equations by any

method and determine the type of solution obtained.

3 x  5 y 0 x  3z  0 x  y  5z  0
( i ) 3x  4y  0 ( ii ) 3 x  y  2 z  0 ( iii ) x  2z  0
4x  8y  0 2x  2y  z  0 2x  y  z  0

2x  4 y  5z  0 x  2 y  6z  0
4 a  12b  7c  20d  0
( iv ) (v ) 4x  y 0 ( vi )  x  y  2 z  0
3 a  9 b  5c  28d  0
2 x  2 y  3 z  0 x  4 y  2z  0

2 a  b  c  2d  0
3x  2 y  3z  0 a  2 b  c  2d  0
3a  4b  d  0
( vii ) x  3 y  6 z  0 ( viii ) ( ix ) a  4b  c  d  0
a  5 b  2c  6d  0
2 x  6 y  12 z  0 3 a  5 b  2c  3 d  0
5a  2b  c  d  0
Exercises (Homogeneus System of Linear Equation & Rank)

2. Find the rank and the number of free variable of the following matrices.

0 2 3   1 1 1 2 
 1 2 1    
( i)   ( ii)  2 3 1  ( iii)  2 2 1 3 
2 3 1   1 1 2   1 1 1 0 
   

3 5 3 2 1  2 4 7 
     
( iv ) 5 2  ( v )  2 1 1 ( vi)  3 6 10 
2 4   4 3 1 1 2 3 
   

2 3 1  1 3 1 1 1 
2 3 4 5     
( vii)   ( viii) 3 3 1 ( ix ) 2 0 1 1 1
 4 6 8 10  2 4 1  1 4 5 0 2 
   
Exercises (Homogeneus System of Linear Equation & Rank) – answer:

1. ( i ) x  0 , y  0 Trivia l s olution
( ii ) x  0 , y  0 , z  0 Trivia l s olution
( iii ) x  2t , y  3t , z  t Infinite ly ma ny s olutions
( iv ) a  3s  96t , b  s , c  52t , d  t Infinite ly ma ny s olutions
( v ) x  0 , y  0 , z  0 Trivia l s olution
10 4
( vi ) x   t , y   t , z  t Infinite ly ma ny s olutions
3 3
21 15
( vii ) x   t , y   t , z  t Infinite ly ma ny s olutions
11 11
( viii ) a  0 , b  0 , c  0 , d  0 Trivia l s olution
41 1 17
( ix ) a   t,b  t,c  t , d  t Infinite ly ma ny s olutions
28 28 28
Exercises (Homogeneus System of Linear Equation & Rank) – answer:

( i) Ra nk = 2 , fre e va ria ble = 1

2.
( ii ) Ra nk = 3, Fre e va ria ble = 0
( iii ) Ra nk = 2 , fre e va ria ble s = 2
( iv ) Ra nk = 2 , fre e va ria ble = 0
(v ) Ra nk = 2 , fre e va ria ble = 1
( vi ) Ra nk = 2 , fre e va ria ble = 1
( vii ) Ra nk = 1 , fre e va ria ble = 3
( viii ) Ra nk = 3, Fre e va ria ble = 0
( ix ) Ra nk = 3, Fre e va ria ble = 2