Which of the following is true about SRT (Shortest Remaining Time) and SJF (Shortest Job First)? Assume that both algorithms know how long jobs will take when they arrive. If all tasks arrive at the beginning, SRT will give the same schedule as SJF. If the tasks arrive in the same order as their required CPU time (i.e., shortest job first), then SJF will give a better schedule compared to SRT in terms of average turn around time. If the tasks arrive in the opposite order as their required CPU time (i.e., longest job first), then both SJF and SRT give the same schedule