Without using arrays and Methods and

max$\_$value

Write a Java program that defines a string called nameId which contains characters from your name and your ID as shown in the example below. Then generate $10$ strings each with the same length as nameId. The program should compute the Levenshtein distance between nameId and each of the generated strings. Finally it should print the top three closest strings to nameId according to the Levenshtein distance.

Note: The Levenshtein distance is defined as the minimal number of characters you have to replace insert or delete to transform string$1$ into string$2.$

Example:

Student name: Ahmad Ali.

Student ID: $202410279$

nameId: $"$A$2$h$0$m$2$a$4$d$1$A$017$i$9"$