Empirical Analysis (counting the "work") 4) Complete the table for each of the following functions. For each foo, write a small program with a loop where n is a counter from O to at least 64. Call the foo within the loop, passing it each value of n, and getting the return value from foo. Fill out a table with each n and its corresponding return value. You can skip some values of n when n starts to get biggish. Capture your output and generate the tables. See the posted "Bsort BigO.cpp" optimization code as an example of this kind of analysis. int fool(int n) return value int counter for(int i #8; i