Note: This question is part of a series of questions that present the same scenario. Each question in the series contains a unique solution that might meet the stated goals. Some question sets might…

Note: This question is part of a series of questions that present the same scenario. Each question in the series contains a unique solution that might meet the stated goals. Some question sets might have more than one correct solution, while others might not have a correct solution. After you answer a question in this section, you will NOT be able to return to it. As a result, these questions will not appear in the review screen. You have a table named Table1 that contains 3 billion rows. Table1 contains data from the last 36 months. At the end of every month, the oldest month of data is removed based on a column named DateTime. You need to minimize how long it takes to remove the oldest month of data. Solution: You implement round robin for table distribution. Does this meet the goal?