Question$15$:

Suppose $H$ is a hash table being used to store integers. $H$ has a size of $5,$ and it uses open addressing with linear probing to resolve collisions. The hash function is

hash$($n$)=n\%($table size$)$

$H$ is currently in this state:

$\backslash$table$[[$Index$,$Data$],[0,],[1,36],[2,],[3,13],[4,19]]$

If we add $29$ to the table, at what index will it be placed? Your answer should be a single integer