c++

12. (A). Given the adjacency matrix of a directed graph write pseudo-code that will calculate and display the in-degree and out-degree of every node in a graph. (B). Write pseudo-code to merge two sorted singly-linked lists to create a third sorted linked list