Every cutoff profile is possible

We introduce fruit-inosculated-tree Markov chains. These chains have easily tunable parameters and are a good source of examples. In particular, we prove that every cutoff profile is possible, with any cutoff time and window size.