Data structures and algorithms Q$1)$ assume the number of characters in the string is n$,$ not including the null terminator character.

for the following code write how many times each operation will be done $($at worst$)$using n$.$

$1-<$

$2-[]$

$3-=$

$4-++$

$5-==$

char$*$ replace$($char$*$ str$,$ char oldChar, char newChar$)\{$

int size $=$ length$($str$)+1$;

char$*$ newVer $=$ malloc$($size$*$sizeof$($char$))$;

for$($int i$=0$; i $<$ size; i$++)\{$

if$($str$[$i$]==$oldChar$)\{$

newVer$[$i$]=$newChar;

$\}$else$\{$ newVer$[$i$]=$str$[$i$]$;

$\}\}$

return newVer; $\}$

Q$2)$ assume the number of characters in the string is n$,$ not including the null terminator character.

for the following code write how many times each operation will be done $($at worst$)$using n$.$

$1-<$

$2-[]$

$3-=$

$4->=$

$5-++$

char$*$ toUpper$($char$*$ str$)\{$

int size $=$ length$($str$)+1$;

char$*$ newVer $=$ malloc$($size$*$sizeof$($char$))$; for$($int i$=0$; i $<$ size; i$++)\{$

if$($str$[$i$]>=\text{'}$a$\text{'}$ && str$[$i$]<=\text{'}$z$\text{'})\{$ newVer$[$i$]=$ str$[$i$]-32$;

$\}$else$\{$

newVer$[$i$]=$ str$[$i$]$; $\}\}$

return newVer; $\}$