L={Set of strings starts with "0"} ={0,00,01,000,001,010,011,...}

First, we start with the initial state (q0). Then if we get "0" as the input it should direct to the final state (q1, since we check that "0" is the first). Here we are not concerned about what happens if it gets "1" as the input. Because here we are designing an NFA not a DFA. After getting "0" as the first input there can be "0"/"1" inputs later. So, we represent them on the q1 state. NFA for the question above