Given a pancake network of order n, the permutations of the set {1, 2,.

Given a pancake network of order n, the permutations of the set {1, 2,...,n} as a vertex set with edges between all vertices in such a way that all corresponding permutations can be found by reversing the other of the first k elements of the permutation. As an example (1,2,3,4) is connected to (2,1,3,4), (3,2,1,4), and (4,3,2,1) but not to (1,4,3,2). For this task, construct a diagram of a pancake network of order 3 using Visio or some other diagramming software.