I came across this problem on leetcode. ( https://leetcode.com/problems/task-scheduler/ ) . I get the intuition of why greedy approach in round robin approach should work but not able to prove that it's always optimal.

Can someone help me in proving it ?

Thanks.