Which scheduling algorithm gives priority to the process with the shortest expected processing time?

a$)$ First$-$Come, First$-$Served $($FCFS$)$

b$)$ Round Robin

c$)$ Shortest Job Next $($SJN$)$

d$)$ Priority Scheduling