What is the largest n for which one can solve within one second a problem using an algorithm that requires f(n) bit operations, where each bit operation is carried out in 20-15 seconds, with these functions of n? а. 52n b. Vn с. п9

I have to solve a large factorial problem by hand because my calculator is giving me an overflow error. Here is the problem:                   (120!*120!) / (100! * 140!). How can I simplify this factorial without a calculator?

Let n be a positive integer. Give a recursive algorithm for computing the sum of the first n positive integers by filling in the boxes in the procedure below with the expressions n, n – 1 or 1. Note: You have to use some expressions more than once, but each box must contain only one of those expressions. procedure sum : positive integer) if then sum 1 else sum + sum

What is the largest n for which one can solve within 10 seconds a problem using an algorithm that requires f(n) bit operations, where each bit operation is carried out in 10^-10= seconds, with these functions of n?