Write a method that returns an int value of the total number of address combinations there are for a randomly created street address, which could include a combination of numbers and maybe letters.

The total number of addresses are based on how many digit or letter “slots” can be in an address (generally 1-6) and the number of values possible in each slot. Not all combinations are possible, so to estimate the number of combinations that will actually work, you should multiply the number of slots times the number of values.

For example, an address may have 3 slots and 10 possible digits and 4 possible letters (N, S, E, or W for the cardinal directions) that could fill each slot. So the total number of combinations for the addresses in this area would be 3 times (4 + 10) which is 42.