You are implementing an array$-$based dictionary with a fixed size of $5$ entries. Illustrate the sequence of insertions, the search operation for a given key, and the status of the dictionary when it becomes full. Perform the following operations:

$($a$)$ Insert entries: $(1,``$One$"),(2,``$Two$"),(3,``$Three$"),(4,``$Four$"),(5,``$Five$")(2\mathrm{.}5$ points$)$

$($b$)$ Search for key $3(1$ point$)$

$$

$($c$)$ Attempt to insert entry $(6,``$Six$")(1\mathrm{.}5$ points$)$