starter code use this

and no scanner method and plz explain how the code will work!!

Due: Monday, February 27, 2023 at 11:59 pm For this problem, we will assign each letter in the alphabet to a number: a1,b2,c3,,z26. A balanced word is a word where the sum of the letters on the left-hand side of the word equals the sum of the letters on the right-hand side. Create a function named isBalanced that receives a single String as a parameter, then returns true if it is balanced and false if it is not. For odd-lengti words, the middle character (balance point) is ignored. Header: boolean isBalanced( string word) \{ /I Type code here Example input/Output: - Input: "zips" Output: true II "zips" "zi | ps" -> 26+9| 16+193535 true - Input: "brake" Output: false // "brake" "br ken2+1811+52016 false Notes: - All Strings will contain only lowercase letters - For Multiple Files, Custom Library and File Execute Mode, Version, Inputs \& Arguments JDK 17.0.1 Interactive CommandLine Arguments