Consider $($QA$)$ be Quick sort algorithm to sort integers in non$-$decreasing order using last element as pivot. C$1$ and C$2$ be the number of comparisons made by QA for the given inputs $(12,8,6,7,8,10)$ and $(4,4,4,4,4,4)$ respectively. What will be the values of C$1$ and C$2?$