<Li> Flow networks are weighted directed graphs where two nodes are distinguished, a source and a sink . </Li> <Li> Rooted directed graphs (also known as flow graphs) are digraphs in which a vertex has been distinguished as the root . <Ul> <Li> Control flow graphs are rooted digraphs used in computer science as a representation of the paths that might be traversed through a program during its execution . </Li> </Ul> </Li> <Ul> <Li> Control flow graphs are rooted digraphs used in computer science as a representation of the paths that might be traversed through a program during its execution . </Li> </Ul> <Li> Control flow graphs are rooted digraphs used in computer science as a representation of the paths that might be traversed through a program during its execution . </Li>

Find the indegree and outdegree of the following digraph