Problem
1. How many calls to visit are made (as a function of V) by the permutation generation procedure?
2. Derive a non-recursive permutation generation procedure from the program given.
3. Write a program which determines whether or not two given adjacency matrices represent the same graph, except with different vertex names. fi.