Question Here is a standard telephone keypad: 1 2 3 4 5 6 7 8 9 * 0 # We say a number qualifies if it satisfies the following conditions: excludes * and # starts with 0 is formed by cycling through three moves: a "tall L" (two steps in one direction followed by one step in the perpendicular direction, or vice versa) followed by two "short L"s (one step in one direction followed by one step in the perpendicular direction). For example, there are: 2 qualifying 2-digit numbers: {04, 06} 4 qualifying 3-digit numbers: {042, 048, 062, 068} 8 qualifying 4-digit numbers: {0424, 0426, 0484, 0486, 0624, 0626, 0684, 0686}. Write a program that returns the number of qualifying n-digit numbers given n, and calculate the number of qualifying 100-digit numbers.