Java 8

No Pairs Allowed You have a boutique that specializes in words that don't have adjacent matching characters. Bobby, a competitor, has decided to get out of the word business altogether and you have bought his inventory. Your idea is to modify his inventory of words so they are suitable for sale in your store. To do this, you find all adjacent pairs of matching characters and replace one of the characters with a different one. Determine the minimum number of characters that must be replaced to make a saleable word For example, you purchased words-add, boook, break]. You will create an array with your results from the tests. Change d in add, change o in boook and no change is necessary in break. The return array result-1, 101 Function Description Complete the function minimalOperations in the editor below. The function must return an array of integers, each resulti] being the minimum operations needed to fix word Constraints 1sns 100 2 s wordsils10 Each character of wordslij e ascila-z). Y Input Format for Custom Testing Input from stdin will be processed as follows and passed to the function. The first line contains an integer n, the size of the array words Each of the next n lines contains a string wordsli]. Sample Case 0 Sample Input 0 ab aab abb abab abaaaba Sample Output 0 Explanation O word-"ab" is already salable so result0-0 word- "aab" is not salable. We can replace wordf0]-'a' with 'g' to get the string "gab, so result 1)-1 word-"abb" is not salable. We can replace word/21-'b' with 'c' to get the string "abc',so result/2)-1 word"abab" is already salable so resuly3) 0 word-"abaaaba' is not salable. We can replace word3-'a' with 'b'to get the string "abababa" and result!4]-1 We then return result [0, 1, 1, 0, 1 YOUR ANSWER Draft saved 02:01 pm Original Code Java 8 H import java. io. * ; 14 15 class Result f 16 17 Complete the minimalOperations' function below 19 20 21 * The function is expected to return an INTEGER ARRAY. The function accepts STRING ARRAY words as parameter. s/ 23 24 25 26 27 28 29 30 31 public class Solution { public static List minimaloperations (List words) /Write your code here