What is the runtime complexity using big$-$O notation in the worst case?

a$.$

int x $=0,$ y $=0$;

for $($i $=0$;

x $+=$ i; $\}$

for $($j $=0$;

y $+=$ j;