Chapter $4$ of the book provides the following algorithm for finding the index of the first occurrence of a given

character in a given string, text:

$1.$ for each index from $0$ to $|$text$|-1$:

$1.$ if text$[$index$]=$ character:

$1.$ stop

$2.$ let index be $|$text$|$

In $[]$:

#Write your answer here

$\%$run $-$i m$269\_$util

test$\_$table $=[$

$[\text{'}$test $1\text{'},$'aeon',$1],$

$[\text{'}$test $2\text{'},$'yippee',$4],$

$[\text{'}$test $3\text{'},\text{'}$mytzlplk$\text{'},8]$

$]$

test$($your$\_$function$\_$name, test$\_$table$)$ #Change the function name in this line to match your

What, if anything, would need to be changed in the algorithm in order to:

find the n$-$th occurrence of a given character in a given string with n $>0.$

As above, if the n$-$th occurence is not found, then index should be set to the length of the string, text. You do

not need to write out the algorithm, just identify changes.

Write your answer here