*Code in java*

You are given an input (n) which represents the amount of lines you are given, your job is to figure out what is the maximum amount of perpendicular bisectors you can make using these lines. Note: A perpendicular bisector is one that forms a 90 degree angle n will always be greater than or equal to Examples with 3 and 4 lines From solution import perpendicular import codewars_test as test atest. describe( "Perpendicular Zines") def perpendicular_tests( ) : atest. describe( "Sample tests") def sample_tests(): atest.it(" n=) def test_zero(): test.assert_equals(perpendicular (),) atest.it(" n=1) def test_one(): test.assert_equals(perpendicular (1), ) atest.it(" n=2 ") def test_two(): test.assert_equals (perpendicular (2),1 ) atest.it(" n=3 ") def test_three(): test.assert_equals (perpendicular (3), 2) atest.it(" n=4 ") def test_four(): test.assert_equals(perpendicular (4),4 ) atest.it( "n=5) def test_five(): test.assert_equals(perpendicular (5),6) atest.it(" n=6) def test_six(): test.assert_equals (perpendicular (6),9) (atest.it(" n=7 ") def test_seven(): test.assert_equals(perpendicular(7), 12) (dtest.it( " n=8 ") def test_eight(): test.assert_equals (perpendicular (8),16 ) atest.it(" n=9 ") def test_nine(): test.assert_equals (perpendicular (9),20 ) dtest.it(" n=51) def test_big(): test.assert_equals (perpendicular(51), 650)