Non$-$preemptive Shortest Job First $($SJF$)$ scheduling policy is not optimal if:

a$)$ All the jobs arrive at the same time

b$)$ The CPU burst run$-$time of each job is known

c$)$ Each job runs for the same amount of time

d$)$ Jobs may arrive at different times