Write the complete C function sum Dig that is passed a two-dimensional n times n (i.e. with n rows and n columns) integer array and the value n and returns the integer sum of the diagonal values from the upper left corner to the lower right corner. For example, if the array t below was passed to your function it would return 8. You need only write the function; no other code is necessary. t 3 2 0 3 1 7 1 0 4