[Parallel Data Processing] (30) Consider a table r with schema R(A,B) and a table s with schema S(B,C). You also have access to an n-processor system, and each processor has a main memory that is large enough (can hold both tables r and s). Describe a parallel algorithm that solves the following problems with n processors in parallel. You should briefly state the data partition strategy (round robin, range partition, or hash partition) you need to use or assume, along with your parallel algorithm. (8) Evaluate the query: r ⋈ r.B