In an M$$ \times $$N matrix such that all non-zero entries are covered in $$a$$ rows and $$b$$ columns. Then the maximum number of non-zero entries, such that no two are on the same row or column, is

The minimum number of colours required to colour the following graph, such that no two adjacent vertices are assigned the same colour, is

How many solutions does the following system of linear equations have?

- x + 5y = - 1
x - y = 2
x + 3y = 3

The recurrence equation
$$\,\,\,\,\,\,\,T\left( 1 \right) = 1$$
$$\,\,\,\,\,\,T\left( n \right) = 2T\left( {n - 1} \right) + n,\,n \ge 2$$
evaluates to