Please answer completely and show all work

Problem 1. Assume your machine has 32 bit words. Assume you can multiply two n word numbers in time 3n2 with a standard algorithm. Assume you can multiply two n word numbers in time 20n3 with a "fancy" algorithm. (a) Approximately, how large does n have to be for the fancy algorithm to be better? (b) How many bits is that? (c) How many decimal digits is that