make a java program to demonstrate the process of isomorphism of 2 graphs, the user will be asked to type the value of the graphs of each table, with a matrix size of 4x4, at the end a graph will be chosen to be multiplied by the matrix permutation and buy if both graphs are isomorphic

package isomorphism;

import java.util.Scanner;
import java.util.Random;
import java.util.Arrays;

public class Isomorphism {

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        Random random = new Random();

        int[][] M = new int[4][4];
        int[][] N = new int[4][4];

        System.out.println("=====Matrix M=====");
        for (int i = 0; i < 4; i++) {
            for (int j = 0; j < 4; j++) {
                System.out.print("[" + i + "][" + j + "] = ");
                M[i][j] = sc.nextInt();
            }
        }

        System.out.println("=====Matrix N=====");
        for (int i = 0; i < 4; i++) {
            for (int j = 0; j < 4; j++) {
                System.out.print("