Given s1, . . . , sn, integers c1, . . . , cn and integer D, give an algorithm to compute p1,...,pn such that the success probability of the entire process is maxi- mized while you do not spend more than D dollars. Your algorithm should run in time polynomial in n and D.

Least square fit to polynomial write a function leastsquarefit3pol that solves a linear system of equations to find a least squares fit of a third order polynomial to an experimental data set given as two row arrays. the function leastsquarefit3pol must explicitly solve a set of linear equations and cannot use polyfit. there should be no restriction on the size of the problem that can be solved.

In cell b18, enter a formula to calculate the amount budgeted for meals. this amount is based on the daily meal allowance and the total travel days (# of nights+1).

Will this setup result in what kathy wants to print?