Give an efficent algorithm that determines an optimal sequence of hotels at which to stop. The input to your algorithm are the mile posts of the variable hotels a$1,$a$2,...,$an$($sorted in increasing order$),$ and the output is the list of hotels at which you should stop to minimize the total penalty of your tirp, include a brief explanation of why your algorithm is correct and what is the runtime efficiency class of your algorithm, justify the answer

thanks