The number of edges in a complete undirected graph G=(V, E) is: Select one: a. l-1 O b. (VDCVI - 1) O c.211 d. (VDCVI - 1)/2 Clear my choice Suppose we are sorting an array of eight integers using Quicksort and we have just finished the first partitioning with the array looking like this 25 1 7 9 12 11 10. Which statement is correct? Select one: a Neither the 7 nor the 9 is the pivol. b. The pivot could be either the 7 or the 9 c. The pivot could be the 7 but it is not the 9 d. The pivot is not the 7. but it could be the 9