Match each of the high level language statements given on the left hand side with the most natural addressing mode from those listed on the right hand side.
(1) A [ I ] = B [ J ] (a) Indirect addressing (2) while ( ∗ A ++ ) ; (b) Indexed addressing (3) int temp = ∗ x (c) Auto increment \begin{array}{clcl} \text{(1)} &\text{$A[I] = B[J]$} & \qquad\text{(a)} &\text{Indirect addressing} \\
\text{(2)} &\text{while }(^*A\text{++}); & \qquad\text{(b)} & \text{Indexed addressing} \\
\text{(3)} & \text{int temp = }*x & \qquad\text{(c)} &\text{Auto increment} \\ \end{array} (1) (2) (3) A [ I ] = B [ J ] while ( ∗ A ++ ) ; int temp = ∗ x (a) (b) (c) Indirect addressing Indexed addressing Auto increment (A) ( 1 , c ) , ( 2 , b ) , ( 3 , a ) (1, c), (2, b), (3, a) ( 1 , c ) , ( 2 , b ) , ( 3 , a )
(B) ( 1 , c ) , ( 2 , c ) , ( 3 , b ) (1, c), (2, c), (3, b) ( 1 , c ) , ( 2 , c ) , ( 3 , b )
(C) ( 1 , b ) , ( 2 , c ) , ( 3 , a ) (1, b), (2, c), (3, a) ( 1 , b ) , ( 2 , c ) , ( 3 , a )
(D) ( 1 , a ) , ( 2 , b ) , ( 3 , c ) (1, a), (2, b), (3, c) ( 1 , a ) , ( 2 , b ) , ( 3 , c )