One significant application of logarithms is found in different computer search routines. For instance, the binary search algorithm on the table (or array) of data takes the maximum of log2n ("log base 2, of n") steps to complete, where n is number of data elements which can be searched. How many steps (at most) are required for a search of the table with 16 elements? 512 elements? Describe.