package charactercourances public class Character Des Evaluate how many bacters to the heat text in the second text . Are the first operand will never seen the same character more than - once... "x" noc allowed. Tracer rechte teperand pears in the second spezand altiple times, the access to the count. The me to see sealeve, at not under the same - Character in the first operant It the f/b> opezand include charactere che not leter Character occurances Implement the function public static int charcourance Intext(String texta, String text 2 in the manner described by the comments Some functions which may be useful are: Character.alesserchant Nested loops may be helpful para exti The lo veters torch for: 2.9 Mb O texta The text to be searchedic.g. un Sretanowny of the letters appear in the dood text. pulse Last cha: Ocearances InText is text. Sering ext2) 1 CharacterOccurances.java package characteroccurances; import java.lang.; 5 public class Characteroccurances { 4 DO 9 1 12 13 14 15 * Evaluate how many characters from the first text appear in the second text. *Assume the first operand will never contain the same character more than * once. e.o. "afax" is not allowed. * If a character from the first operand appears in the second operand * multiple times, only the first occurence adds to the count. * The result 13 case sensitive, so 'a' and 'A' are not considered the same * character in the first operand. * If the first operand includes any characters which are not a letter (e.g.'s', '/', '2'), then-1 must be returned. param texti The list of characters to search for. e.g. "abftx" Gparam text2 The text to be searched. e... "Java is fun" * @return How many of the letters appear in the second text. public static int charoccurancesInText(String texti, String text2) > 17 19 19 20 21 22 23 24 25 ) 26 Character occurances Implement the function public static int charoccurancesInText (String texti, String text2) in the manner described by the comments. Some functions which may be useful are: Character.isLetter (char) Nested loops may be helpful