5(a)Let a n be the number of 01 strings of length n that do not have two consecutive 1's Find a recurrence relation for a n (starting with initial conditions a 0 = 1, a 1 = 2) Solution By considering whether the last term is a 0 or a 1, get the Fibonacci recurrence a n = a n 1 a n 2Anagram Solver Scrabble Word Finder and Words With Friends cheat dictionary Use the word unscrambler to find all the words you can make with your letters!Word solver searches show results for Scrabble, Words With Friends, WordHub, and crossword helpWant to learn even more words?Z z z f h q wu d od y h q x h f k u \ v oh u mh h s f r p h h s wk h x q g lv s x wh g lq j r i wk h r ii u r d g d g y h q wx u h lq y lwh v \ r x wr f olp e lq wr wk h g u ly h u Chicago Rail Junctions Griffith C o n j u g a l