2 (a) Write an algorithm that prints the out-degree of each vertex for an adjacency [3+1] matrix Mat. Analyse the running time of your algorithm (b) At the Rabin-Karp algorithm, for matching a pattern from a string of digits, [1+2] why do we use the modulo operation Show an example in which case the worst-case scenario occurs in the Rabin-Karp algorithm. (C) "Sorting is an NP problem"- is the statement correct. Explain briefly. [2]