Using the Fibonacci sequence, print out a lower case letter (from the English alphabet) the number of times of the Fibonacci number in the corresponding index A number in the Fibonacci sequence is calculated by: n[x-2]+n[x-1 n[x] The sequence starts with n]1 and n[2] 1. The index begins at 1, not 0. Be careful of off by 1 crrors. You do not have to worry about exceeding the English alphabet's max index of 26