Prove that the number of partitions of a set, denoted by S(n,k)S(n, k)S(n,k), satisfies the recurrence relation S(n+1,k)=S(n,k−1)+k⋅S(n,k)S(n+1, k) = S(n, k-1) + k \cdot S(n, k)S(n+1,k)=S(n,k−1)+k⋅S(n,k) for 1≤k≤n1 \leq k \leq n1≤k≤n. Use this relation to calculate S(5,3)S(5, 3)S(5,3).