Assume that we have a relation Employee$($id$,$ name, bio, manager$-$id$).$ The values of id and manager$-$id are integers each with a fixed size of $8$ bytes. The values of name and bio are character strings and take at most $200$ and $500$ bytes, respectively. Note that as opposed to the values of id and manager$-$id$,$ the sizes of the values of name $($bio$)$ are not fixed and are between $1$ to $200(500)$ bytes. The size of each page is $4096$ bytes $(4$KB$).$ The size of each record is less than the size of a page. Students may use pages and reuse their solution for Assignment $4,$ adapting it to implement the hash index structure described in this assignment. Using the provided skeleton code with this assignment, write a C$++$ program that creates a hash index file for relation Employee using attribute id$.$ Your program must also enable users to search the created index by providing the id of a record.