Let m be a positive integer. A partition of m is a multiset (set that can have repeated elements) of positive integers, P={P₁ ...........Pₛ}, whose sum is P₁ +.......+Pₛ = m. Note that each positive integer has finitely many integer partitions. We can order such integer partitions of m as follows: Pᵢ ≤ Pⱼ if we can get Pᵢ form Pⱼ by splitting apart some of the elements. For example, {2,2,1}≤ {4,1} since 2 + 2 = 4 and 1 = 1. Draw the Hasse diagram of the partially ordered set of integer partitions of m = 5.