A phone banking password consists of 2 letters followed by 4 digits. The letters B and X are not used, and the last digit cannot be 0. How many different passwords are possible? A. 5,184,000
B. 3,779,136
C. 5,760,000
D. 6,760,000

Girardo is using the model below to solve the equation . girardo uses the following steps: step 1 add 4 negative x-tiles to both sides step 2 add 1 negative unit tile to both sides step 3 the solution is which step could be adjusted so that gerardo's final step results in a positive x-value? in step 1, he should have added 4 positive x-tiles to both sides. in step 1, he should have added 3 negative x-tiles to both sides. in step 2, he should have added 4 negative unit tiles to both sides. in step 2, he should have added 1 positive unit tile to both sides.