Shortest Job First $($SJF$)$ is a relatively simple CPU scheduling algorithm for process management. Consider that there are two busy multi$-$programming systems A and B$.$ The new processes created on System A are mostly long CPU burst processes with only

occasional short CPU burst processes. The new processes created on System B are mostly

very short CPU burst processes.

$($i$)$ State whether process starvation is likely to occur on either or both System A and System B$.$

$($ii$)$ If process starvation occurs on System A$,$ state which type of processes is likely to be

starved. Similarly, if process starvation occurs on System B$,$ state which type of processes

is likely to be starved. Your answer should refer to relevant characteristics of SJF

algorithm.