Provide pseudo code for algorithm named COUNTINTERSECTION that computes the number of integers that appear in the intersection of its two input sets A and B that are represented as lists (i.e., A = (a_1, a_2,.. ., a_m: integers, m greaterthanorequalto 2); B = (b_1, b_2, ..., b_n: integers, n greaterthanorequalto 2)). For the input, each list contains no duplicates, and the integers in each list are not sorted