Please solve 1.2 Problem

1. (exercise 1.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. 2. (exercise 1.2) We've implicitly assumed that each call to Compute_next_value () requires 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? For example, 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. my_sum = 0; my_first_i = ...; my_last_i = ...; for (my_i = my_first_i; my_i