This question is about implementing outer join. Assume we have the tables Pokemon and Captured from the previous part, and we want to compute Captured RIGHT OUTER JOIN Pokemon ON charName mputing this join using a simple hash- Question 13 (5 points): Consider co oin algorithm when Captured will fit in memory. That is, it will be the inner input, which is inserted into a hash table. Explain how to adapt the hash-join algorithm to produce the additional rows needed for the outer join. Question 14 (10 points): Now suppose that Pokemon will fit in memory, but Captured won't (so Pokemon will be the inner, hashed input). Explain how to adapt the hash join to produce the additional rows. Be sure to describe any additional information that the algorithm must maintain. This question is about implementing outer join. Assume we have the tables Pokemon and Captured from the previous part, and we want to compute Captured RIGHT OUTER JOIN Pokemon ON charName mputing this join using a simple hash- Question 13 (5 points): Consider co oin algorithm when Captured will fit in memory. That is, it will be the inner input, which is inserted into a hash table. Explain how to adapt the hash-join algorithm to produce the additional rows needed for the outer join. Question 14 (10 points): Now suppose that Pokemon will fit in memory, but Captured won't (so Pokemon will be the inner, hashed input). Explain how to adapt the hash join to produce the additional rows. Be sure to describe any additional information that the algorithm must maintain