Suppose you are going on a road trip with friends. unfortunately, your headlights are broken, so you can only drive in the daytime. therefore, on any given day you can drive no more than d miles. you have a map with n different hotels and the distances from your start point to each hotel x1< x2< < xn. your final destination is the last hotel. describe an efficient greedy algorithm that determines which hotels you should stay in if you want to minimize the number of days it takes you to get to your destination. what is the running time of your algorithm?

Suppose s, t, and w are strings that have already been created inside main. write a statement or statements, to be added to main, that will determine if the lengths of the three strings are in order by length, smallest to largest. that is, your code should determine if s is strictly shorter than t, and if t is strictly shorter than w. if these conditions hold your code should print (the boolean value) true. if not, your code should print false. (strictly means: no ties) example: if s, t, and w are "cat", "hats", and "skies" your code should print true - their lengths are 3-4-5; but if s, t, and w are "cats" "shirt", and "trust", then print false - their lengths are 4-5-5 enter your code in the box below