starter code is here

and also explain how this code will help solve the problem thank you

A boomerang is a V-shaped sequence that is elther upright or upside-down. Specifically for this FRQ, a boomerang is " a sub-array of length 3 , with the first and last digits being the same and the middle digit being different." Examples: - [3,7,3] - [1,1,1] [5,6,5] Create a function named boomerangs that recelves a single array of integers as a parameter, then returns the number of boomerangs in the array. Header: int boomerangs( int[] nums ) \{ H Type code here \} Example input/Output: - Input [9,5,9,5,1,1,1] Output: 2 - Input: [3,7,3,2,1,5,1,2,2,2,2] Output: 3 Input: [1,7,1,7,1,7,1] Note: [5,5,5] is NOT considered a boomerang because the middle digit is not different from the first/last digits. You will recelve Starter Code for this assignment, but you will not receive Tester Code. You are free to create your own tester code, though. 1. public class Myclass \{ 2. static int boomerangs( int [] nums ) \{ // WRITE CDOE HERE For Multiple Files, Cl Execute Mode, Version, Inputs \& Arguments JDK 17.0.1 CommandLine Arguments