Which of the following sets of constraints forms an unbounded feasible region? x≤0, y≥0, y≤2 x≥0, x≤2, y≥0, y≤3 x≥-2, x≤0, y≥0, y≤2 x≥0, x≤2, y≥0, y≤2

The third one is the right answer

-1/2 +2

step-by-step explanation:

solution:

→c= a b , that is product of a and b is possible only when when a is m × n matrix and b is n × p matrix.

that is, number of columns of a= number of rows of b.

so, size of matrix , c= a b is , if a = (m × n)matrix

b= (n × p)matrix

then a b = [ (m × n)matrix] ×[   (n × p)matrix ]

→→c= a b= [m × p ] matrix

→→size of product a b will be equal to = number of rows of a × number of columns of b