Find a bijection that that takes the set of n-dyck paths to the set of noncrossing partiotions [n]. That is, given a path, construct a noncrossing partition. Prove your map is a bijection.