Solve the following problem by using the Priority Scheduling algorithm, draw a Gantt Chart,

and calculate the average waiting time.

Consider the following page reference string:

$3,2,3,4,2,1,3,4,2,1,4,3,2,1,5$

How many page faults would occur for the Least Recently Used $($LRU$),$ assuming three frames?

Page Faults $=$