Suppose you were to drive from madison to rapid city (black hills), south dakota along i-90. your gas tank when full holds enough gas to travel m miles and you have a map that gives distances between gas stations along the route let d1 < d2 < < dn be the locations of all the gas stations along the route where di is the distance from madison to the gas station i. you can assume that the distance between neighboring gas stations is at most m miles. your goal is to make as few gas stops as possible along the way. give a greedy algorithm you can find to determine at which gas stations you should stop and prove that your strategy yields an optimal solution.

Acetylene is a gas which burns rapidly on its own, and is considered highly explosive. a) true b) false

[a] create a class called “cycle” which has two instance integer variables as properties, “numberofwheels” and “weight.” create a constructor with two parameters, using the same variable names in the parameter list. assign each variable to numberofwheels” and “weight” respectively. write a separate application to test the class and display its properties. note: do not change the names of the instance variables or the variables listed in the constructor’s parameter list. [b] edit your class cycle by adding a default constructor which will assign the default values of 100 to represent the numberofwheels, and 1000 to represent the weight, by invoking a call to the other constructor. modify your application created in [a] to test the class.

Which option allows you to view slides on the full computer screen?