Using dynamic programming, fill in the table of the minimum time fi$[$j$]$ needed to get

through station Si$,$j and the line of the station just before Si$,$j on the fastest way to get

through Si$,$j$.$ Show all the intermediate steps in computing these values. $(8$ marks$)$