What is the largestnfor which one can solve within one second a problem using an algorithm that requiresf(n) bit operations, where each bit operation is carried out in 10-9seconds, with the functionsf(n) below? Click and drag the correct answer to complete each statement.