Page > of 11 Prob. 4. Hash Table Suppose the table T has 11 memory location, T[0], T[2]..... T[I0], and suppose the file F consists of 8 records. A. B. C. D, E. X. Y, Z, with the following hash valuers Record ho A B C D E XY Z (a) Fill in these 8 records into the table T (closed hashing; linear probing): Table T Index 0 1 Record (b) If the file F has these 8 records in the order of Z, Y, X, E, D, C, B, A with the same hash values as given, fill the table T Table T Index 0 Record 10