A strongly connected component $(\mathrm{SCC})$ of a directed graph $\mathrm{G}=(\mathrm{V}, \mathrm{E})$ is a maximal set of vertices such that any two vertices in the set are mutually reachable.
Given a directed graph $G=(V, E)$, it is convenient to represent the connectivity properties of $G$ using an associated directed acyclic graph $G^{\prime}=\left(V^{\prime}, E^{\prime}\right)$, where the vertices in $V^{\prime}$ are the strongly connected components of $G$ and for $S, T \in V^{\prime},(S, T)$ is in $E^{\prime}$ if and only if there exist $u \in S$ and $v \in T$ such that $(u, v) \in E$.
Let $G$ be the graph shown below.
Let the number of vertices & edges in its associated directed acyclic graph $G^{\prime}$ be $A, B$ respectively, then what is $A+B?$
