Question:

Consider a digraph D on 5 nodes, named x0, x1,.., x4, such that its adjacency matrix contains 1's in all the elements above the diagonal
A[0,0], A[1,1], A[2,2],.., etc, and contains 0's in all the elements along and below this diagonal.
    
        | 0    1    1    1    1 |
        | 0    0    1    1    1 |
        | 0    0    0    1    1 |
        | 0    0    0    0    1 |
        | 0    0    0    0    0 |
       
a) Draw this digraph.
b) Form a table to record for each node its indegree, outdegree, and degree.