Computer Science - Algorithms - Quick sort - Partition Tracing

8 questions. Q1: Partition [3,6,8,10,1,2,1], pivot=last(1). After partition, pivot at index? → 0 (1 is the smallest). Q2: Partition [10,80,30,90,40,50,70], pivot=70. Elements ≤70? → [10,30,40,50,70] (left side). Q3: After partitioning, is the pivot in its final sorted position? → Yes, always! Q4: Wo