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|

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.