what the heck I went ahed to my teacher and asked her what P versus NP. is and I don't know what it is and she walked away please help me

The P versus NP problem is a major unsolved problem in computer science. It asks whether every problem whose solution can be quickly verified can also be solved quickly.

P is the set of problems whose solution times are proportional to polynomials involving N's. ... NP (which stands for nondeterministic polynomial time) is the set of problems whose solutions can be verified in polynomial time. But as far as anyone can tell, many of those problems take exponential time to solve.

answer: f true

step-by-step explanation:

step-by-step explanation:

we are given a graph for system of inequalities.

in order to write the system of inequalities for the given graph, we need to find the inequality for each of the line separately.

let us find the slope of dotted line first.

taking two coordinates on the graph.

let us say (0,0) and (3,1).

let us find the slope of the line now.

slope of the dotted line would be =.

y-intercept of dotted line is y=0 only.

plugging slope m= and b=0 in slope-intercept form y=mx+b, we get

.

the line is shaded up of that dotted line.

therefore, for shading up we would take greater than inequality symbol > .

and because it's a dotted line we would take only > symbol in place of = sign in above equation of line.

therefore, inequality for dotted line would be

let us take two points (3,1) and (0,4) on the solid line.

slope of the solid line would be =.

for the solid line we have y-intercept b= 4.

plugging slope m= -1 and b=4 in slope-intercept form y=mx+b, we get

y = -1x + 4.

the line is shaded down of that solid line.

therefore, for shading down we would take less than inequality symbol < .

and because it's a solid line we would take ≤ symbol in place of = sign in above equation of line.

therefore, inequality for solid line would be