Can you code this triple sum challenge via using JOption java language. Then the user can input just like the example(picture).

or there's no need to use user input, explain to me pls.

Given 3 arrays a, b, c of different sizes, find the number of distinct triplets (p, q, r') where p is an elemen pea, q E b, and rec satisfying the criteria: p r. For examplegiven a = [3,5,7), b = [3,6], and c= [4,6,9). we find four distinct triplets: (3, 6, 4), (3, 6, 6), (5,6,4), (5,6,6). Function Description Complete the triplets function in the editor below. It must return the number of distinct triplets that can be given arrays. triplets has the following parameter(s): .a, b, c three arrays of integers. Input Format The first line contains 3 integers lena, lenb, and lenc, the sizes of the three arrays. The next 3 lines contain space-separated integers numbering lena, lenb, and lenc respectively, Constraints 1