You are tasked with implementing a hash table to store student records based on their student IDs. The hash table uses linear probing for collision resolution and has a size of $13.$ The hash function is defined as $h(key)=$key$\%13.$

Given the following student IDs, insert them into the hash table in the order provided and show the state of the hash table after each insertion. Resolve collisions using linear probing:

Student IDs to insert: $25,42,17,6,32,19,8$

Show the state of the hash table after inserting each student ID$.$

Initial Hash Table $($Size: $13)$: $q,]$

$[14$ Marks$]$