Evaluate the following affirmations regarding planarity and planarity testing algorithms:

I. A multi-graph is considered planar when it admits a plane drawing.

II. To postulate Euler's formula ($N-L+F=2$), one can start with a single node and observe        the  effect on $N$, $L$, and $F$ when adding a new node connected to an existing node, or when    adding a link between two existing nodes.

III. Kuratowski's Theorem states that a graph is planar if and only if it contains a subdivision (the process of replacing a link by a path) of $K_{3,3}$ or of $K_{5}$, effectively making them mandatory subgraphs for planarity.

IV. The pseudo-code for the DMP algorithm begins by starting with a single node and iteratively selects a fragment $B$ with the maximum number of faces $F(B)$ that contain all its vertices of attachment.

V. When using the DMP algorithm, a fragment of a graph $G$ with respect to a subgraph $H$ can be an edge in $G$ which is not in $H$ but whose endpoints are located in $H$.

Choose the alternative that correctly identifies the true affirmations:

a) Only affirmations I, III, and IV are true. 

b) Only affirmations II, III, and V are true. 

c) Only affirmations I, II, and V are true. 

d) All affirmations are true. 

e) None of the above.

Original idea by: Matheus de Oliveira Saldanha