Two int arrays, A and B, contain m and n ints each, respectively. The elements within each of these arrays appear in ascending order without duplication (i.e. each table represents a set). Give C code for a E (m + n) algorithm to find the set difference by producing a third array C (in ascending order) with the values that appear in A, but not B, and sets the variable p to the final number of elements copied to C. (Details of input/output, allocation, declarations, error checking, comments and style are unnecessary. Just give the control structures and assignment statements.)

Example: A = {1, 2, 4, 5, 7, 11}, B = {0, 1, 2, 6, 7, 13}, C = {4, 5, 11}, p = 3