Giving a hash list would 800 sales for data, suppose you plan on placing 450 items into the list. If you use open addressing with linear probing how many elements will have to be examined when searching for an item in the list (rounded to the nearest decimal place)? If you use open addressing with chained hashing how many elements will have to be examined when searching for an item in the list (rounded to the nearest decimal place)?