Determine time and space complexity of the following ,and express it using Big Oh notation:

```
Procedure Add(a,b,c,m,n)
{ // a,b and c are 2-dimentional arrays of size m X n
for i=1....m do
for j=1....n do
c[i,j]=a[i,j]+b[i,j];
}
```

I want any one to answer and explan the question please