I will surely give a thumps up

Create Java solution for following tasks. Use only minimal amount of external libraries. 1. Create an algorithm that counts sum of number characters of given number. For example 1>1,11>2 (as 1+1=2),3126( as 3+1+2=6) 2. A substring is a part of string. For example in 'Savonia' has substrings 'von' and 'avo'. Create an algorithm that counts how many time substring can be found from string. For example if function is called countOccurrence int countOccurrence("Kukukuguuguu", "ku") Would return 3 3. Create a function for following algorithm: Input parameter is size n array that contains only positive integers. For each step form a new array of which each member is sum of two adjacent members of first array. Continue this until there's only array that has only one member and return this member. Idea: input parameter [1,2,3] Next: [3,5] Next:[8] return 8. For array [1,2,3,4,5]>[3,5,7,9]>[8,12,16]>[20,28]> [48] returns 48 Submit a java file with solutions inside