Question$2$

Devise formulas to calculate my$\_$first$\_$ i and my$\_$last$\_i$ in the following code snippet from the lecture. Assume

that $p($number of cores$)$ and $n($number of values$)$ are available to all cores, and each core has a value my$\_$id$,$

which is a unique identifier between $0$ and $n-1.$ You can also assume $n$ is divisible by $p.$

Your answer needs to depend on my$\_$id$,n$ and $p$

my$\_$sum $=0$;

my$\_$first$\_$i ${?}_{-}=$dots;

my$\_$last$\_$i $=...$;

for $($my$\_$i$=$my$\_$first$\_$i; my$\_$i$+=m{y}_x$;