Please solve all the question. And write down the correct answers as number. In this exercise, we develop a dynamic programming based solution $($using a spreadsheet or Python$)$ similar to the one in Exercise $1.$ Let us consider a $3-$class dynamic capacity allocation problem for a flight that has $90$ seats under the following assumptions: at most one booking request takes place in a period and the probability that this arrival is of class $i$ is given in the below table along with respective class fares $($the same assumptions from the lectures$)$:

$\backslash$table$[[$Class $(i),p_i,q_i$