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?

last option

step-by-step explanation:

given that δdef is right and isoceles,

assuming that side df is the hypotenuse means that de an ef are the other 2 sides that intersect at 90° and are of equal length.

because they are of equal length, we can say that they are congruent

because they intersect at 90°, their slopes must be opposite reciprocals.

only the last option satisfies these conditions.

y do u put "subscirbe to ence" on a app for ppl who need with their work?