Suppose the burst time is as follows:

P1:7  P2:5 P3:10 P4:6 P5:3

for FCFS: the average waiting time is:69/5=13.8

for Shortest-job-First:the average waiting time is :9.2

then let us add arrival time for each process like:

P1:2 P2:4 P3:10 P4:0 P5:14

then for Shortest-job-First algorithm the average waiting time is:25/5=5

and for Priority Scheduling we add priorities for each processes:

P1:1 P2:2 P3:4 P4:3 P5:5

the average waiting time is :65/5=13

and add the same arrival time .the average waiting time is :39/5=7.8

finally for Round-Robin Scheduling,we distribute time as a time quantum of  4 milliseconds,the average waiting time is :53/5=10.6