प्र: What would be the output of the following program assuming that the array beigns at location 1002? main() {    int a[3][4] = {                             1 , 2 , 3 , 4                             5,  6 , 7, 8                             9, 10 , 11, 12                        };     Printf ("\n%u %u %u", a[0] + 1, *( a[0] + 1), *( *(a + 0) + 1) ); }