the time it took to perform a dictionary attack on a file of MD5 digests. Number of words tried : 2198690 Number of Seconds:831 passwords found:

the time it took to perform a dictionary attack on a file of MD5 digests.

Number of words tried : 2198690

Number of Seconds: 9.831

passwords found: 5

Assume there is a hash algorithm called X that is simply 1000 iterations of MD5. If this password file indicated that X had been used instead of MD5 approx how many seconds would it have taken?

i have no clue how to work this problem please explain what I need to do thanks