Kruskal algorithm is a Dynamic Programming approach to solve the Single Source Shortest Path problem true or false Match each the following running time t$($n$)$s with the tightest possible upper bound. When

answering, please use the alphabets provided for each asymptotic class $($not the actual running

time$)$ as shown in the sample bullet; also note that you may refer to any asymptotic class more

than once.