Create a pseudocode algorithm that calculates the nth number in the sequence. Remember, the sequence starts with $0$ and $1,$ so the first Fibonacci number $($n$=1)$ is $0,$ the second $($n$=2)$ is $1,$ and so on$.$How would this look in full english pseudocode?