A hashtable is implemented with an array with initial length 5. Collisions are resolved by linear probing with probe length 2. The load factor is .75. The load factor is checked using the number of elements already in the hashtable before a new element is added: add(element) check load factor add element count ++ The hash function is: index = key % array_length The array capacity is doubled upon a resize event. The following data are added in this order: 15,27,1,45. 15 is stored at which index? 45 is stored at which index? Now, 44 is added. 44 is stored at which index? 27 is stored at which index