Given the following request queue -- 2, 27, 8, 76, 42, 20 84, 31, 92, 97 with the disk head initially at the track 35 initially moving in the positive direction (towards 100). The beginning of the disk is at 0 and the end of the disk is at 100. Calculate the travel distance for the C-LOOK algorithm. Assume all reads are made in the positive direction if applicable.

You should hand write your references on your resume.

The animal classthis class represents a an animal residing at a zoo. it has a weight (in pounds),height (in inches), a name, and a color. the methods in the class include constructors,getters, and a tostring. you will finish the implementation of these methods. referto the code documentation.1.getters: you will need to implement getter methods. these get a value (froma member variable) in the animal class. you will make a getter method toreturn each variable (weight, height, name, color). reference getname if youare having issues.2.tostring: you will need to finish the tostring method. this returns a stringcontaining information about an animal. the output string should be of theformat: ” (name) , a ( color )â’colored animal . ( weight ) pounds , ( height ) inches .\n”the height and weight are formatted to 1 decimal place. recall from lab 1how to format strings neatly using string. see the reference sectionfor more about string.format.

List 3 items that were on kens resume that should have been excluded