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 theta (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.) a = {1, 2, 4, 5, 7, 11}, b = {0, 1, 2, 6, 7, 13), c = {4, 5, 11}, p = 3