Question $9$

Consider the following processes with burst times and artival tirtes

$\backslash$table$[[\backslash$table$[[$Process$],[$ID$]],\backslash$table$[[$Arrival$],[$time$]],$Burst time$],[$A$,0,4],[$B$,1,5],[$C$,2,1],[D,3,2],[$E$,4,4]]$

Which CPU scheduling algorithm has the average waiting tim