Consider the same method again:

public boolean isprefix$($String s$1,$ String s$2)\{$

int i $=0$;

if$($s$1.$length $>$ s$2.$length$)$

return false;

while$($i $<$ s$1.$length$)\{$

if$($s$1[$i$]!=$ s$2[$i$])$

return false;

i$++$;

$\}$

return true;

$\}$

Use the active operation approach and determine the exact number of times the active operation is executed in the worst case. Express your answer in terms of n$,$ the length of the string s$1.$