}

      else if(job->priority <= current_job->priority){ // if job's priority is less than or equal to current_job's priority, insert job

        prev_job->next = job;                        // keep in mind 1 is the highest priority given to jobs, head has a

        job->next = current_job;                     // priority of zero so it will always be before other jobs

        break;

      }

      prev_job = current_job;

    }

  }

}

/**

  Frame Finder: matches your computer up with a lovely frame to render

  TODO: Major issue here, the client needs to know the frame number, AND the job number!

  Notice that this function starts by looking at the oldest job first

	TODO: Link this up with the main() function to check if there are frames available or not and provide jobnum/framenum to the client

  @return 0 success, other: error

*/

int frame_finder(struct distrenjob *head, struct distrenjob **job, struct frameset **frame)

{

  int your_frame;  // your_frame is an integer value that will be given to the client as the frame number to render

  unsigned short int found;

  unsigned short int priority;

  struct distrenjob *distrenjob_ptr;

  found = 0;

  while(!found)

    {

      /* enumerate through priority levels */

      for(priority = 10;

        priority > 0

            && !found;

           priority --)

	/* Find the job with the highest priority */

        for(distrenjob_ptr = head;

            distrenjob_ptr != NULL

            && !found;

            distrenjob_ptr = distrenjob_ptr->next)

          if(distrenjob_ptr->priority == priority)

	    found = 1;

      if(!found)

        {