Problem 5 -20 points Write the pseudo-code of an algorithm that reads (1) a list X of length n, and (2) a list Y of length m s n. Assume that Y is populated with all different integers between 0 and n-1. The algorithm should print the sum of the elements in X with indexes (i.e. indexed) in Y. For instance, if: 113 2, 3 9, 7,5, and Y- [0, 3, 6, 2]: the algorithm should print Xo +X3+ XX26+7+2 16