Given a hash table of size n $=8,$ with indices running from $0$ to $7,$ show where the following

keys would be stored using hashing, open addressing, and a step size of c $=3($that is$,$ if there is a collision search sequentially for the next available slot$).$