Consider an integer array, nums, which has been declared and initialized with one or more integer values. Which of the following code segments updates nums so that each element contains the square of its original value?

I.

int k $=0$;

while $($k $<$ nums.length$)$

$\{$

nums$[$k$]=$ nums$[$k$]*$ nums$[$k$]$;

$\}$

II$.$

for $($int k $=0$; k $<$ nums.length; k$++)$

$\{$

nums$[$k$]=$ nums$[$k$]*$ nums$[$k$]$;

$\}$

III.

for $($int n : nums$)$

$\{$

n $=$ n $*$ n;

$\}$

Responses

II only

II only

I and II only

I and II only

I and III only

I and III only

II and III only

II and III only

I, II$,$ and III