Write a C program to simulate Shortest Job First CPU scheduling policy with Gantt chart

$\backslash$table$[[\backslash$table$[[$Process$],[$Name$]],\backslash$table$[[$Arrival$],[$Time$]],\backslash$table$[[$Burst$],[$Time$]],\backslash$table$[[$Wait$],[$Time$]],\backslash$table$[[$Turn$],[$Around$],[$Time$]]],[$P$0,0,10,,],[$P$1,1,5,,],[$P$2,3,15,,],[$P$3,5,25,,]]$

Display average wait time and turnaround time