this is supposed to be done in java pseudocode.

Write a very high level (basic) description of how the hash table "get" mechanism works. Write it in short, separate steps (1, 2, 3..., ) -- no more than five short steps. The get mechanism is defined on the ADT as: Get (and return) the value associated with the parameter "key", or null if not found Do not get into "sub-processes" (just the higher level processes). Here is an example for (style) using the subject how a dynamic array add mechanism works: Mechanism for adding "anElement" to fixed array: 1. Dynamic array has a private sub-component that is a fixed array 2. Fixed array sub-component is initially constructed with "initial capacity" (all elements are initially blank/null values. All of these blanks are "open slots" to add elements into. 3. When an element is added, a check is done to see if there is any available capacity in fixed array 1. if not, a new larger fixed array is constructed (which now becomes the fixed array sub-component) 2. existing elements are copied into it new fixed array 4. "anElement" is appended to first open slot in fixed array 5. Note that the first "open slot" index can always be derived as equal to "size" of the structure (where "size" is the # of elements).