how can we prove the number of partitions of $n$ into odd parts equals the number of partitions of $n$ into distinct parts using Ferrers graph

Question

We have a famous partiton identity which states "the number of partitions of $n$ into odd parts equals the number of partitions of $n$ into distinct parts". This is a famous result of Euler on partitions.. I know the proof using generating functions. But how can we prove the number of partitions of $n$ into odd parts equals the number of partitions of $n$ into distinct parts using Ferrers graph