Subject: Design analysis of Algorithms

For each statement below, indicate whether it is a true statement with T, or a false statement with F. For false statements, you have to correct the statement. Note that adding a not in the statement will not be considered as a correction:

f. ( ) The encoding and decoding algorithms for RSA cryptographic system have efficient implementations, but the difficulty is in guessing the prime factors p and q of N. g. (n) Disjoint sets data structures can be used to develop efficient O(nlogn) implementation of the Kruskal's Algorithm used to finding a minimum spanning tree of a graph G