Problem 3. Assume that each word of your machine has 64 bits. Assume that you can multiply two n-word numbers in time 3n2 with a standard algorithm. Assume that you can multiply two n-word numbers in time 8n!93 with a fancy algorithm. For each part briefly justify and show your work. (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