Insert the keys: 34, 19, 47, 23, 58, 52, 74 аnd 86 intо а hаsh table оf size 13 with the hash functiоn h1 (x) = x mod 13 and using linear probing to resolve collisions. Create a table showing the index positions and the keys which have been inserted into the table. See the example table below: A M index 0 1 2 3