Below is a list of keys together with the values returned by hashCode () for each of them. The keys A, B, C and D were inserted in order into a SeparateChainingHashST with a table size of 2, resulting in the array st looking like this: What will the array st look like if a call to resize(4) is made (to double the size of st )? O --> A 1 -->D 2 --> C 3 --> B C 0 --> A 1 - -> B-->D 2 (--> C 3 --> 0 --> --> B 2 --> C 3 --> D --> C-->A 1 (--> D-->B 2 - -> 3 -->