We know : 2D arrays are stored by default in Row-major order in C-programming language.
A[i][j] = base address + [(i - start index) × n + (j - start index)] × s.
Where,
m = no. of rows,
n = no of columns,
S = memory size,
Given, base address = 0,
start index = 0, s = 1,
arr [100][100] = a[m][n] ≈ arr[0 .... 99][0 ..... 99]
∴ m = 100, n = 100
Arr[20][30] = 0 + [(20 - 0) × 100 + (30 - 0)] × 1
= 2000 + 30
Arr[20][30] = 2030.