Write a complete Java program that starts by declaring four integer constants, and one boolean constant, with the following initial values:

final int START $=$;

final int END $=10752$;

final int INCREMENT $=256$;

final int COLUMNS $=8$;

final boolean RIGHT$\_$JUSTIFY $=$ true;

The program should print the numbers between START and END $($inclusive$),$ counting up by INCREMENT, in COLUMNS neatly$-$aligned columns of width $6$ characters. The numbers in each column would either be left or right justified depending on RIGHT$\_$JUSTIFY. The values above should produce output like this:

$\backslash$table$[[0,256,512,768,1024,1280,1536,1792],[2048,2304,2560,2816,3072,3328,3584,3840],[4096,4352,4608,4864,5120,5376,5632,5888],[6144,6400,6656,6912,7168,7424,7680,7936],[8192,8448,8704,8960,9216,9472,9728,9984],[10240,10496,10752,,,,,]]$

End of program. $***$

If RIGHT$\_$JUSTIFY was false it would produce this:

$\backslash$table$[[0,256,512,768,1024,1280,1536,1792],[2048,2304,2560,2816,3072,3328,3584,3840],[4096,4352,4608,4864,5120,5376,5632,5888],[6144,6400,6656,6912,7168,7424,7680,7936],[8192,8448,8704,8960,9216,9472,9728,9984],[10240,10496,10752,,,,,]]$

COMP $1020$ Lab $1$

End of program.