An asteroid belt is a region between the orbits of Mars and Jupiter in our solar system filled with numerous asteroids. This region contains safe and dangerous zones. We'll use a string to represent this area, with $\text{'}$S$\text{'}$ indicating safe zones and $\text{'}$D$\text{'}$ representing dangerous ones. Develop a function called PathFinder. This function will take a string as input and determine the longest consecutive sequence of safe zones. It will calculate this sequence and return it to the main program. In the main program, you need to read the asteroid belt, pass it to the function, and print the returned value. Instructions $$ You will use a while loop to iterate through the string to check if each character is $$S$$ or $$D$$ Create variables to keep track of the current sequence length and the longest sequence length. Initialize both to $0.$ For each character, compare the current sequence length with the longest sequence length and update the longest sequence length if necessary. $$ Calculate and display the length of the longest safe sequence. Sample Run $1$: Enter the asteroid belt: SSDSSSSDSD Longest safe sequence: $4$ Sample Run $2$: Enter the asteroid belt: DDDSSSDSSDDDSSSSDSSSSSSSDSDS Longest safe sequence: $7$ Sample Run $3$: Enter the asteroid belt: SDSDSDSDS Longest safe sequence: $1$