Added Tower of Hanoi recursive algorithm and a sample test case

Author: Nikhilesh Satish

src/main/java/com/thealgorithms/recursion/TowerOfHanoi.java

@@ -2,8 +2,8 @@
 
 /*Tower of Hanoi Problem on Wikipedia - https://en.wikipedia.org/wiki/Tower_of_Hanoi */
 
-public class TowerOfHanoi {
-
+public final class TowerOfHanoi {
+    private TowerOfHanoi(){}
     public static void solveHanoi(int n, char src, char dest, char aux) {
         if (n == 1) {
             System.out.println("Move disk 1 from " + src + " to " + dest);