Given the following program segment: 7. k: m while m s k do if p(k) is true then k: k+1 (a) is the proposition p(k) "k! > 5k" an invariant of this loop for k 2 4? for all integers n 2 4 (b) use induction to prove or disprove that n! > 5

option 1 is correct.

step-by-step explanation:

y varies inversely with x and constant of variation is 4

the equation will be:

y = k/x

where k =4 so,

y = 4/x

if we put values of x of option 1 in the above equation and find values of y

y = 4/-2 => y =-2

y = 4/-1 => y = -4

y = 4/1 => y = 4

y = 4/2 => y =2

so, all the values of x and y are correct.

if we put values of x given in other options and find value of y we cannot find whole table satisfying the equation.

hence option 1 is correct.

damm bro the struggle

step-by-step explanation:

i think the correct option is the second option.

y = 3x+4

step-by-step explanation:

to find the slope

slope = (y2-y1)/ (x2-x1)

    = (-8-4)/ (-4-0)

    = -12/-4

  = 3

using the slope intercept form of a line

y= mx+b

we know the slope is 3

we know the y intercept is 4 ( the point where it crosses the y axis or x=0)

y = 3x+4