Consider the same method again:

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

int $i=$;

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

return false;

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

if $(s1[i]s2[i])$

return false;

$\}$

i$++$;

$\}$

$\}$

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 $s1.$

Hint: simplify your final answer as much as possible, and do not put spaces in your answer. Use juxtaposition for the multiplication

operator, for example to write "nine times n$"$ write $"9$n$"$ not $"9$xn$"$ or $"9*n"$; to write "four times $(n+2)"$ write $"4($n$+2)",$ not $"4$x$($n$+2)"$

or $"4*(n+2".$ Do not write your answer in Big$-$O notation. Write the exact number of lines executed.