bestInPlants Function Name: bestInPlants Input: $(1$ N struct$)$ Structure array with the description of the people who are competing $(1$ M char $)$ Name of the banned field Output: $(1$ P char $)$ A sentence describing the winner and the runner up Description: Write a function that takes in a $1$xN structure array of participants and finds the winner based on the criteria below. Each structure will have a Participants field with the name of the person, a BaseNumber field with a numerical score, a Multiplier field with a numerical value, and other fields that represents various attributes of their plants. The values of these fields will be either $\text{'}$Y$\text{'}$ or $\text{'}$N$\text{'}.1.$ Delete the participants that have a value of $\text{'}$Y$\text{'}$ for the banned field and then remove the field from the structure array. $2.$ Calculate the base score of each participant by multiplying the BaseNumber entry with the Multiplier entry. Place these values into a new field in the structure array called Uniqueness. Then, delete the BaseNumber and Multiplier fields. $3.$ Find if the Rare and Variegated fields exist. The participants who have $\text{'}$Y$\text{'}$ as the value for either of those fields gain $4$ points to their uniqueness score. If they have both, add $10$ points. $4.$ Sort the structure array by the Uniqueness score in descending order. $5.$ Find the first place winner $($participant with the best score$)$ and the runner up and output the results: $\text{'}$ is the winner of the Best In Plant contest and is the second place winner!$\text{'}$