An OS uses SJF algorithm. Consider the following set of processes with their arrival times and CPU burst times (in ms).
| Process | Arrival Time | Burst Time |
| A | 0 | 10 |
| B | 3 | 8 |
| C | 6 | 9 |
| D | 10 | 4 |
Find the average waiting time.
Enter numerical value using the virtual keypad. Round off where necessary.