please i want solution in java programming language

String minimization 0 You are given a string made of lowercase English letters a, b, and c. Your task is to minimize the length of the string by applying the following operation on the string: 1. Divide the string into two non-empty parts, left and right part. 0 2. Without reversing any of the parts, swap them with each other by appending the left part to the end of the right part. 3. While appending, if the suffix string of the right part and the prefix string of the left part contain the same character, then you can remove those characters from the suffix and prefix of the right and left part respectively 4. Repeat the third step until you do not find such prefix and suffix strings Determine the minimum length of the string after applying the above operations exactly once on a string. D.O For example, you are given the following string: aabcccabba Step 1: left part: aabcc and right part: cabba Appending both strings: In the string cabbaaabcc, you can remove aaa from the string and the new string will be cabbbcc. 0.0 In the string cabbbcc, you can remove bbb from the string and the new string will be cacc. Step 1: left part: aabcc and right part: cabba Appending both strings: In the string cabbaaabcc, you can remove aaa from the string and the new string will be cabbbcc. In the string cabbbcc, you can remove bbb from the string and the new string will be cacc. You cannot reduce the string cacc. Input format First line: s Output format Print a single integer denoting the minimum length of the string after applying the operation. Constraints 2