PQ$02$ Describe an algorithm in pseudocode with a running time $0($x$+$x$)$ for the following problem stated below: Intersection: Input: Two sorted arrays A and B$,$ of lengths x and y respectively. Assume that the elements of A are distinct, and the elements of B are also distinct. AB Output: An array labelled C containing all the elements in in increasing order Afterwards, explain the algorithm, and justify how correct it is and the running time.