I need help with the following problem in Java please. These are the instructions:

Problem ALGO07a Write a Class called Problem ALG007a to do the following: You must take in an input string parameter called text and look for pairs of strings in text, breaking the string up using spaces as the delimiter. There are two types of pairs that your program must find, combo-pairs and next-to-pairs, and you'll need to find a count of each. Next-to-pairs appear next to each other, while combo-pairs cover every combination that can be found of pairing the strings. This is best explained with an example: If the input string text is: spring java spring spring spring javascript java jboss jboss tomcat jboss Then your program must output: spring: 6 combo-pairs (0,2) (0,3) (0,4) (2,3) (2,4) (3,4) AND 2 next-to-pairs (2,3) (3,4) java: 1 combo-pair (1,6) AND O next-to-pairs javascript: 0 combo-pairs AND O next-to-pairs jboss: 3 combo-pairs (7,8) (7,10) (8,10) AND 1 next-to-pair (7,8) tomcat: 0 combo-pairs AND O next-to-pairs