Write a method that takes an integer number $($either positive or negative$),$ and finds and returns the largest digit in that number.

Requirements:

Do not use arrays in your solution.

Do not convert integer into a string in order to extract digits. Use $\%$ operator instead.

Start coding with TwoMethodsA$03.$zip Download TwoMethodsA$03.$zip

Make sure to write method code according to the specifications and test them using unit tests provided in TwoMethodsA$03.$zip Download TwoMethodsA$03.$zip

Do not add any imports to the project $-$ all packages needed for solution are already imported.

Do not alter any of the tests. If your code is not passing a test, find and fix errors in your method implementation rather than changing the test code.

No partial credit will be given for a method that fails even one test.

Two Methods fractionSum$()$ method

Write a method that calculates and returns sum of fractions $1/2+2/3+...+$ n$/($n$+1)$ where value n is passed as parameter and defines the length of the pattern and the sum. The method returns $-1$ if the value of n is less than $1.$

Examples:

fractionSum$(1)=1/2$

fractionSum$(2)=1/2+2/3$

fractionSum$(3)=1/2+2/3+3/4$

fractionSum$(5)=1/2+2/3+3/4+4/5+5/6$

fractionSum$(0)=-1$

Start coding with TwoMethodsA$03.$zip Download TwoMethodsA$03.$zip

Make sure to write method code according to the specifications and test them using unit tests provided in TwoMethodsA$03.$zip Download TwoMethodsA$03.$zip

Do not add any imports to the project $-$ all packages needed for solution are already imported.

Do not alter any of the tests. If your code is not passing a test, find and fix errors in your method implementation rather than changing the test code.

No partial credit will be given for a method that fails even one test.