Need help with $1\mathrm{.}2$ please! $1\mathrm{.}1$ Devise formulas for the functions that calculate my$-$first$\_$i and my$\_$last$\_$i in the global sum example. Remember that each core should be assigned roughly the same number of elements of computations in the loop. Hint: First consider the case when n is evenly divisible by p$.1\mathrm{.}2$ We've implicitly assumed that each call to Compute$\_$next value requires roughly the same amount of work as the other calls. How would you change your answer to the preceding question if call i$=$k requires k$+1$ times as much work as the call with i$=0?$ So if the first call $($i$=0)$ requires $2$ milliseconds, the second call $($i $=1)$ requires $4,$ the third $($i $=2)$ requires $6,$ and so on$.$