Consider the topic of "Sequence Alignment in Linear Space via Divide-and-Conquer". Refer to the PPT presentation, slide 12, the pseudocode "Divide-and-Conquer-Alignment(X,Y)". What is the running time for computing q in line 7, "let q be the index minimizing f(q,n/2) + glq,n/2)" ? O O(m") O(n) O(21) O(m) O(mn)