you are asked to implement a decision making mechanism for stock buying from the financial market. Your aim is to find the investment that generates the best outcome for you. For this our AI module generate $2-$d array market where each market$[$i$][$j$]$ shows the future outcome of stock $[$j$]$ if bought at time $[$i$].$However, there are $3$ rules in this market. $1.$You must buy only one $($exactly one$)$ stock at a given tine $($discrete time steps$)2.$You cannot buy a stock twice $3.$ You cannot buy a stock at a given time if a bigger id stock is already been bought in earlier time steps. $($e$.$g$.$ if you choose to buy stock $5$ at time t$=2,$ you cannot consider buying stocks $0,1,2,3,4$ after that point$)4.$ No consecutive stocks $($in terms of stock ids$)$ can be bought. $($e$.$g$.$ you cannot buy stock $5$ at time t $=2$ and then stock $6$ at time t $>=3)$Your task is to generate a stock buying order sequence to maximise your outcome. question$1$: Write a recurrence that express the optimal value for buying stock n$,$ at time t for t$>=1$ as a function f$($t$,$n$)($you do not need to consider the base case t$=0)$