Describe (in words, pseudocode, etc., but not actually code) a dynamic programming algorithm to solve the following problem: For any n ≥ 12, how many binary strings of lengt
