A new operating system uses passwords that consist of three characters. Each character must be a number from 0-9. For example, three distinct possible passwords are 010, 189, 356. The system doesn't use salt values. The system also allows one login attempt every second and never locks out users regardless of how many failed attempts occur.

The adversary has paid off one of the company's system administrators who will periodically provide the adversary with a copy of the password file consisting of (user and hashed password). The adversary decides to build a rainbow table to speed up password cracking when the password file arrives. Suppose it takes the adversary 2 milliseconds to hash a string and takes 1 millisecond to compare two hash values. How many seconds will it take the adversary to build the rainbow table? Note: 1000 milliseconds = 1 second

Don't forget to covert your answer to seconds (1 second = 1,000 milliseconds)