(2) If a insert sort of n items takes 8 seconds, a insert sort of 2n items would take approximately seconds (2) If a linear search of n items takes 4 seconds, a linear search of 2n items would take approximately seconds (2) If a binary search of 1024 items takes 10 seconds, a binary search of 2048 items would take approximately. seconds.

Make sure you have a firm grasp of the heap's operation while dealing with dynamic data. What are the advantages of utilizing dynamic data in programming?

Compute the following modular inverses. (Remember, this is *not* the same as the real inverse).1/5 mod 9 =1/3mod5 =1/13mod14 =

3