Apply Brent’s Method in order to create an index table for given data set (keys), with table size 13 (n) using h(key)=key MOD n (as hash function) and i(key)=int(key/n) MOD n (as increment function)

Apply Brent’s Method in order to create an index table for given data set (keys), with table size 13 (n) using h(key)=key MOD n (as hash function) and i(key)=int(key/n) MOD n (as increment function). Keys: 98, 35, 28, 61, 84, 41, 78, 58, 26, 86, 35, 97, 75, 30, 94 After each insert please write the content of table as a single row (separated with comma) starting from the very first element of your table. For the empty locations please use -1. e.g. For an empty table with size 5: "-1,-1,-1,-1,-1" Note: Above line is just an example about how you will give your answers (after each insertion), your index table size is NOT 5 it is 13 as given in question.