HPF pre emptive algorithm updated

In our main class, I added a test case I wrote myself. This way we can
figure out the HPF pre emptive by hand and compare it with the program.
I took out the queue code from the HPFPre (I used RR class as a base)
and made the code its own class HPFQueue. The HPFpre code is not
efficient, what I did was basically run the RR algorithm 4 times on 4
different queues and I had the program run down the list of queues by
priority. The program checks the queues priority by the conditions I set
inside the code. I'm too tired to figure out a way to make it cleaner
and be less lines of code. For now this is what I have, it seems to work
from all the test cases I ran on it though. Feel free to change the test
case I added by changing the numbers around and let me know what if
anything wrong or try and fix it if you can.