A binary search is not always the fastest way to search a sequentially allocated main memory table. First consider tables whose size is less than about 50 items. Explain why a sequential search may be faster if each element in the table has an equal probability of being the desired item. Second explain a method for searching a sequentially allocated table which may be faster than a binary search when the data obeys W. P. Hesings 80/20 rule (or a Pareto distribution). How might tables fitting the 80/20 rule adjust their selves over time if the reference frequency for table contents is subject to change?