2. Insert the following (key, value) pairs into a hash table of size 10 . Use the same hashing function as above on the key (determining the index by modding by the size of the array, of course). Use linear probing to handle collisions. Remember to store both the key and the value in the table. - (SANDY, Toksvig) - (NOEL, Fielding) - (PAUL, Hollywood) - (PRUE, Leith) - (SUE, Perkins) A=0,B=1,C=2,D=3,E=4,F=5,G=6,H=7,I=0,J=1,K=2,L=3,M=4,N=5,O=6,P=7,Q=0,R=1,S=2,T=3,U=4,V=5,W=6,K=7,Y=0,Z=1