string winner$($string erica, string bob$)\{$

int ericaScore $=0$; $//$ Initialize Erica's score to $0$

int bobScore $=0$; $//$ Initialize Bob's score to $0$

int n $=$ erica.length$()$; $//$ Get the length of the input strings

$//$ Loop through each day's problem

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

$//$ Check the difficulty of the problem Erica solved on that day

if $($erica$[$i$]==\text{'}$E$\text{'})\{$

ericaScore $+=1$; $//$ Add $1$ point for an easy problem

$\}$ else if $($erica$[$i$]==\text{'}$M$\text{'})\{$

ericaScore $+=3$; $//$ Add $3$ points for a medium problem

$\}$ else if $($erica$[$i$]==\text{'}$H$\text{'})\{$

ericaScore $+=5$; $//$ Add $5$ points for a hard problem

$\}$

$//$ Repeat the same steps for the problem Bob solved on that day

if $($bob$[$i$]==\text{'}$E$\text{'})\{$

bobScore $+=1$;

$\}$ else if $($bob$[$i$]==\text{'}$M$\text{'})\{$

bobScore $+=3$;

$\}$ else if $($bob$[$i$]==\text{'}$H$\text{'})\{$

bobScore $+=5$;

$\}$

$\}$

$//$ Compare scores to determine the winner

if $($ericaScore $>$ bobScore$)\{$

return "Erica"; $//$ Erica wins

$\}$ else if $($bobScore $>$ ericaScore$)\{$

return "Bob"; $//$ Bob wins

$\}$ else $\{$

return "Tie"; $//$ It's a tie

$\}$

$\}$