21:19 T moodle.cs.colorado.edu Suppose you have an algorithm foo that takes as input a sequence of numbers of length n and does something with it. You do some timing benchmarks for foo by testing it on sequences of increasing length and get the following table (with times shown in seconds). n timing 8 32 Based on the timings, which value for p can you conclude gives the complexity O(n), of the procedure foo? Choose # a