Here’s a classic problem in the study of algorithms: Given a length n, list all the “binary strings” of length n can be made such that none contains two or more consecutive 1s? For example, given length n = 4, the possibilities are “0000,” “0001,” “0010,” “0100,” “0101,” “1000,” “1001”…