You are given an array of heights of pile of boxes. You have to return the number of steps required to bring the height of entire pile to the same height as pile with minimum height. In one step, you can lower the tallest pile only to the next taller pile. You can adjust only one pile in a step even though 2 piles could be of same height. Following examples will illustrate this better,\n\n**Example 1:**\n```\nInput: arrOfHeights = [150, 210, 210, 80, 110]\nOutput: 9\nExplanation:\nStep 1 [150, 150, 210, 80, 110]\nStep 2 [150, 150, 150, 80, 110]\nStep 3 [110, 150, 150, 80, 110]\nStep 4 [110, 110, 150, 80, 110]\nStep 5 [110, 110, 110, 80, 110]\nStep 6 [80, 110, 110, 80, 110]\nStep 7 [80, 80, 110, 80, 110]\nStep 8 [80, 80, 80, 80, 110]\nStep 9 [80, 80, 80, 80, 80]\n```\n\n**Example 2:**\n```\nInput: arrOfHeights = [843, 247]\nOutput: 1\nExplanation:\nStep 1 [247, 247]\n```\n\n**Example 3:**\n```\nInput: arrOfHeights = [2]\nOutput: 0\n```

You are given an array of heights of pile of boxes. You have to return the number of steps required to bring the height of entire pile to the same height as pil