Solve the following processes in table, by using Shortest Job First $($non$-$preemptive method$)$ and calculate average waiting time.

$\backslash$table$[[$Process$,$Burst Time$],[$P$1,5],[$P$2,4],[$P$3,8],[$P$4,9],[$P$5,3]]$