Match each algorithm below with the tightest asymptotic upper bound for its worst-case running time by inserting one of the letters A, B, C, D, and E into the corresponding box. For sorting algorithms, n is the number of input elements. For matrix algorithms, the input matrix has size n X n. For graph algorithms, the number of vertices is n, and the number of edges is (n). Aadaki her bir algoritmay, A, B, C, D ve E harflerinden birini ilgili kutuya ekleyerek en kt durum alma sresi iin en sk asimptotik st snrla eletirin. Sralama algoritmalar iin n, girdi elemanlarnn saysdr. Matris algoritmalar iin girdi matrisinin boyutu n x n'dir. Grafik algoritmalar iin ke says n'dir ve kenar says (n) 'dir. Insertion Sort Heapsort Depth-first search (for the adjacency list representation) Floyd-Warshall Strassen's O(n^log7) O(n) On logn 0(n^2) 0(n^3) O(1) 0(n^4) O(logn)