Please solve this

Ex1. is

Given a mapping f: {1,2,...,n} + {1, 2,...,n} of the form F(W) for some vertebrate W, describe how the vertebrate W can be recon- structed from the knowledge of f. Prove that any mapping f can be obtained as F(W) for some vertebrate W (use Exercise 1). - For a mapping f: V + V, where V is a finite set, we define the (directed) graph of f as the directed graph with vertex set V and edge set {li, f()): i EV} (such a graph was used in the proof above). Prove that each (weakly connected) component of such a graph is a directed cycle, possibly with some trees hanging at the vertices of the cycle, with edges directed towards the cycle. Given a mapping f: {1,2,...,n} + {1, 2,...,n} of the form F(W) for some vertebrate W, describe how the vertebrate W can be recon- structed from the knowledge of f. Prove that any mapping f can be obtained as F(W) for some vertebrate W (use Exercise 1). - For a mapping f: V + V, where V is a finite set, we define the (directed) graph of f as the directed graph with vertex set V and edge set {li, f()): i EV} (such a graph was used in the proof above). Prove that each (weakly connected) component of such a graph is a directed cycle, possibly with some trees hanging at the vertices of the cycle, with edges directed towards the cycle