(5 pts) Give a bit-O estimate of (logn + 2)n.

{3 + i, 3 - i, 3, -1}

step-by-step explanation:

answer: -0.5 would be the most likley outcome

step-by-step explanation:

graph b

step-by-step explanation:

one solution- graph a (clear intercepting point.)

no solution- graph b (they're parallel, there will never be a point of interception.)

infinite solutions- graph c (all points intercept.)

where does the z at is it on the x axes or on the y axes any way if it is on the y axes put it horizontally and if it is on the x axes put it vertically