C#

2018 C. Equilibrium 1. Create a method called IsEquilibrium that takes an array of integers with at least three num 2. The method will return true if the arra y can be divided into exactly three partitions, such that the difference between the sum of all the numbers in the left partition and the sum of all the numbers in the right partition is equal to the sum of all the numbers in the middle partition. 3. Because there is no way to know where these partitions are located in the array (i.e, they can occur anywhere), you will need to search for these partitions in the array by brute-force Since the difference between two numbers can be in any order, you should check for both left- right as well as right - left. 4. Here is a simple example. While you are searching through the array, you will need to calculate all the sums from the left and right partitions and then check whether their difference is the same as the sum from the middle partition. Aft you find three partitions that satisfy 30-20 10 er all the iterations, you will be able to identify the exact partitions, where Right Partition Sum (Right)-30 Middle Partition Left Partition Sum (Left) 20 Sum (Middle) 10 12 4 6 You will need to come up with your examples to better understand the approach. Hint: Think about the "Combination approach" we've discussed in the class, in which you will need to go through all the combinations of two-or-three elements in the array