Write the final state of the hash map after the following key$/$value pairs are added and removed. Assume that it uses the standard "mod" hash function shown in the chapter and uses linear probing for collision resolution. Write each pair in key$=$value format, or X in any index in which an element is removed and not replaced by another element. Do not perform any resizing or rehashing.

HashMap map $=$ new HashMap$()$;

map.put$(8,"$Q$")$;

map.put$(27,"$J$")$;

map.put$(34,"$T$")$;

map.put$(57,"$R$")$;

map.put$(45,"$Y$")$;

map.put$(74,"$S$")$;

map.put$(27,"$M$")$;

map.put$(95,"$K$")$;

map.remove$(74)$;

map.put$(76,"$T$")$;

map.remove$(8)$;

map.remove$(5)$;

map.put$(14,"$D$")$;