Question $5$: Cost Function Analysis

Given the following algorithms, compute the Cost Function and the Big$-$Oh complexity $O(n).$ Show all steps and work as described in the lecture slides:

a$)$ let $x$ be an array of size $n$

for $i=0$dots$\frac{n}{2}$

for $j=0$dotsn

$x[i]=x[i]+j$