If CPU burst time of all the process is equal Then SJF (shortest job first) scheduling algorithm is equivalent to

i) FCFS (First come first served)

ii) Round Robin with time quantum greatest then the largest CPU burst

iii) Highest priority first

iv) Shortest remaining time first