Can you please explain and show how to do the problem. Also please write legibly. Thanks!

Problem 5. A bit string is a finite ordered list of zeros and ones. The length of a string is the number of characters (list items) that comprise the string. Let B, be the number of bit stings with length n that contain the substring "01" (that is, the strings that have a O somewhere in the string that is followed immediately by a 1). a. Derive a RRwIC for B. Hint: The only excluded string that begins with zero is the string that only contains zeros. (Why?) b. Solve the RRWIC using iteration