Suppose that I have a hash table data[CAPACITY]. The hash table uses open addressing with a quadratic probing. The table size is a global constant called CAPACITY. Locations of the table that have NEVER been used will contain the key -1. All valid keys will be non-negative, and the hash function is: int hash_function(int key) { return (key $ CAPACITY); Complete the implementation of the following functions. There is no need to check the precondition, but your code must be as efficient as possible. Implement the following functions. const int CAPACITY = 10; void initTable(int data[]);// data[CAPACITY] ={-1, -1, -, -1} void printTable(int data[]); int hash_function(int key); void hashInsert(int data[], int key); bool key_occurs(int data[], int search_key); Part 1: Insert keys {10, 22, 11, 31, 24, 88, 38, 21} into an empty hash table with CAPACITY = 10 using quadratic probing (c1=0 and c2=1) to resolve collision (You shouldn't use a for/while loop except to increment the value of i for quadratic probing). Part 2: Check whether following numbers (11, 31, and 23) are in the table. (You shouldn't use a for/while loop except to increment the value of i for quadratic probing).

Which header file is necessary for C++ OOP?  What attribute permits open recursion?

What is a string in c-programming? Give the Importance of strings in c-programming, types of strings in c, and give an example of a program code with strings that can be executed.

Create a list of some common C++ classes, and describe when each class is used.

In the context of data binding, what is meant by "binding expressions"? How are they typically used?