How does an array of all duplicates make quicksort O(N^2)?

Question

In my data structures & algorithms class we learned about 3-scan and Hoare\'s partitioning algorithms. I was told that we get the worst case of O(N^2) on an array of all