uestion $4-$

Consider the working set model with $\backslash$Delta $=3.$ Given the following reference string of a process p:

y x x x x x x y y u x x x y z y z w w z x x w w

a$.$ What is the largest working set process p will ever have?

b$.$ What is the smallest working set process p will ever have $($not counting the first $\backslash$Delta references$)?$