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.

Assume the existence of a bankaccount class. define a derived class, savingsaccount that contains two instance variables: the first a double, named interestrate, and the second an integer named interesttype. the value of the interesttype variable can be 1 for simple interest and 2 for compound interest. there is also a constructor that accepts two parameters: a double that is used to initialize the interestrate variable, and a string that you may assume will contain either "simple", or "compound", and which should be used to initialize the interesttype variable appropriately. there should also be a pair of functions getinterestrate and getinteresttype that return the values of the corresponding data members (as double and int respectively).

Explain the importance of html in web page designing in 20 sentences..

Guys do you know sh27 cause he hacked me : ( pidgegunderson my old user