import java.io.*;
import java.util.*;

import net.datastructures.Entry;
import net.datastructures.HeapPriorityQueue;
import net.datastructures.HeapAdaptablePriorityQueue;

/*
* Process Scheduling class
*/
public class ProcessScheduling {

static int MAXIMUM_WAIT_TIME = 10;
static String outputFile = "process_scheduling_out.txt";
static FileWriter fw;

// Method to run simulation
public static void simulation(HeapPriorityQueue<Integer,Process> D) throws IOException {
   int currentTime = 0;
   Process runningProcess = D.min().getValue();
   boolean running = false;
   HeapAdaptablePriorityQueue<Integer,Process> Q = new HeapAdaptablePriorityQueue<Integer,Process>();
   double totalWaitTime = 0.0;
   int count = D.size();

   while (!D.isEmpty()) {
         Process p = D.min().getValue();
         if (p.getArrivalTime() <= currentTime) {
            D.removeMin();
            Q.insert(p.getPriority(), p);
         }
         if (!Q.isEmpty() && running == false) {
            runningProcess = Q.removeMin().getValue();
            runningProcess.setStartTime(currentTime);
            totalWaitTime += runningProcess.getWaitTime();
            fw.write("Process removed from queue is: id = " + runningProcess.getID() + ", at time " + currentTime + ", wait time = " + runningProcess.getWaitTime() + '\n');
            fw.write("Process id = " + runningProcess.getID() + '\n');
            fw.write("    " + "Priority = " + runningProcess.getPriority() + '\n');
            fw.write("    " + "Arrival = " + runningProcess.getArrivalTime() + '\n');
            fw.write("    " + "Duration = " + runningProcess.getDuration() + '\n');
            running = true;
         }
         currentTime++;
         if (D.isEmpty()) {
            while (runningProcess.getFinishTime() > currentTime) {
               currentTime++;
            }
         }
         if (runningProcess.getFinishTime() <= currentTime) {
            fw.write("Process " + runningProcess.getID() + " finished at time " + currentTime + '\n');
            running = false;
            decrementPriorities(currentTime, Q);
            fw.write('\n');
         }
   }
   fw.write("D is empty" + '\n' + '\n');
   while (!Q.isEmpty()) {
         if (!Q.isEmpty() && running == false) {
            runningProcess = Q.removeMin().getValue();
            runningProcess.setStartTime(currentTime);
            totalWaitTime += runningProcess.getWaitTime();
            fw.write("Process removed from queue is: id = " + runningProcess.getID() + ", at time " + currentTime + ", wait time = " + runningProcess.getWaitTime() + '\n');
            fw.write("Process id = " + runningProcess.getID() + '\n');
            fw.write("    " + "Priority = " + runningProcess.getPriority() + '\n');
            fw.write("    " + "Arrival = " + runningProcess.getArrivalTime() + '\n');
            fw.write("    " + "Duration = " + runningProcess.getDuration() + '\n');
            running = true;
         }
         currentTime++;
         if (Q.isEmpty()) {
            while (runningProcess.getFinishTime() > currentTime) {
               currentTime

Use the the bellman - ford algorithm and implement it in java. It s...