Transitive cycle factorizations and prime parking functions

Minimal transitive cycle factorizations and parking functions are related very closely. Using the correspondence between them, we find a bijection between minimal transitive factorizations of permutations of type (1,n−1) and prime parking functions of length n.