Question 9
Given a multiset of -mers , the pseudocode of the algorithm to construct the de Bruijn graph (G) is given below. Fill in the four blanks.
multiset S_k = collection of input k-mersset S_{k-1} = ϕfor every i ∈ S_k add i[1, k − 1] and i[2, k] to set S_{k-1}for every i ∈ __I__ add the node __II__ to Gfor every i ∈ S_k add the edge from __III__ to __IV__ in Greturn G