How many comparisons are required to merge these pairs of lists using algorithm 10? a.1, 3, 5, 7, 9; 2, 4, 6, 8, 10 b.1, 2, 3, 4, 5; 6, 7, 8, 9, 10 c.1, 5, 6, 7, 8; 2, 3, 4, 9, 10?

the system of inequity is

step-by-step explanation:

from the given graph it is noticed that we have two related lines. one is solid and another is dashed.

if a line passing through two points, then the equation of line is

the solid line passing through the points (0,4) and (4,0).

the related equation of solid line is .

similarly, find the related equation of dashed line. the dashed liune passing through the points (0,0) and (3,1).

the related equation of dashed line is

from the given graph it is noticed that the point (0,1) lies on the shaded region, therefore the point (0,1) must be satisfied by the related equations.

check the related equations by the point (0,1).

this statement is true if the sign of inequality is < instead of equality. since it is an solid line therefore the sign of inequality will be . the required inequality is

similarly, check the second related equation.

it is a dashed line, so this statement is true if the sign of inequality is > . the required inequality is

cant open file sorry!

step-by-step explanation: