Virtual university Of Pakistan

Question No. 1 Given the following graphs convert it into  tree  data structure. A)    In the following graph consider node  1  as your starting point

CS402 Assignment No 01 Fall 2019 Idea Solution Q1. Show that the following pairs of regular expressions define the same language over the alphabet