If the degree of the given row doesn$$t match the degree field of the table, throw an illegal argument exception.

$2$ Create a new row composed of the key parameter and an unmodifiable view of the list of fields parameter.

$3$ Linear search the array to find an old row with the given key.

$4$ On a hit, replace the old row at its index within the filled region with the new row, then return the old list of fields.

$5$ On a miss, append the new row to the filled region, increase the size by $1,$ then return null.

$6$ Before returning from a miss, if the size equals the capacity, dynamically expand the array.

i Double the capacity field, keeping it a power of $2.$

ii Reassign the array field to reference a copy of itself with a length equal to the new capacity.