8.5 Set up stock prices in nodes e nodes with the appropriate stock prices . Now we must fill the stock price I . Note that the arrays are rectangular, whereas the binomial tree is triangular . Hence we are allocating too much memory by a factor of 2, but never mind for now . You can do this differently, if you use STL, etc. . I declare pointers "S.tmp" and "V.tmp" to help out, but you can do it differently Fill the first node stock nodes [0] [0] S.tmp stock_nodes [O] S-tmp [0] = S ; Fill the remaining (relevant) nodes. . We use i to index the time steps and j to index the price steps for (i -1; i