g A computing facility has to perform n processing jobs {J1 , J2 , … , Jn}. Each Ji demands three types of computers: at first, a supercomputer for the time ri , then a regular desktop for the time qi and after this, a specialized computer for the time ti . The facility has only one supercomputer that can perform only one job after another but it has more than n desktops and more than n specialized computers. Design an efficient algorithm allowing finding the schedule to do all jobs with the minimal time and estimate the complexity of this algorithm.