6. (5 points) Describe an algorit all elements that are in bo points) Describe an algorithm that, given two sorted arrays of Nint values, prints out nents that are in both arrays, in sorted order. The running time of your algorithm should be proportional to N in the worst case. 7. (5 points) Give an argument that the average number of array accesses for any sequence of Stack operations (starting from an empty stack) is constant time in the worst case when the Stack is implemented as a resizing array. (This is an amortized analysis.)