1- which of the following scheduling algorithms could result in starvation? why? if any, show how can starvation problem be resolved.
a. first-come, first-served (fcfs)
b. shortest job first (sjf)
c. round robin (rr)
d. priority?

25.3

step-by-step explanation:

1st step

add 3+6

=9

multipy 9*3

=37

45.36 feet per second.

step-by-step explanation:

to find the most accurate determination for the number of feet per second tyrone traveled on his way to work let us convert miles to feet and minutes to seconds.

1 mile = 5280 feet.

1 minute = 60 seconds.

now we will divide 158400 by 3492 to find the most accurate determination for the number of feet per second tyrone traveled on his way to work.

therefore, tyrone traveled on his way to work at the rate of 45.36 feet per second.

4y - 6 + y^2 - 9 = y^2 + 4y - 15

y^2 term

terms

- terms

total of 3 terms when simplified

step-by-step explanation: