Question: write an algorithm described in pseudocode that reads in two...

Write an algorithm, described in pseudocode, that reads in two sorted lists LA and LB and the number n of integers in both of the lists, and prints out the number of integers that occur in both lists. You may assume that an integer occurs at most once in each given list. For ex-ample, given lists LA= [1;2;5;7;13;19] and LB= [2;9;13;14;19;22] and n = 6, the elements f {2;13;19} occur in both lists and the printed output is thus 3