Question

suppose the table T has 11 memory location T[1],T[2],....,T[11] and suppose the file F consist of 8 record A,B,C,D,E,X,Y,Z and with following hash adderess Record :A,B,C,D,E,X,Y,Z H(k) :4,8,2,11,4,11,6,1,.Suppose the 8 record are entered into the table T in the reverse order Z,Y,X,E,D,C,B,A,.show how the file F appears in memory and also find that the average number of 'S' of probs for a successful search and the average number of 'U' of unsuccessful search.