In a project, tasks $$A, B, C, D, E, F, G, H, I$$ and $$J$$ are to be performed. The precedence relationships and the time required (in days) to complete the tasks are given in the Table.

The time required (in days) to complete the project along the critical path is ______________

Consider a network with nodes $$1, 2, 3, 4, 5$$ and $$6.$$ The nodes are connected with directed arcs as shown in the table below. The respective costs (in $$INR$$) incurred while traversing the directed arcs are also mentioned.

The second shortest path from node $$1$$ to node $$6$$ (i.e. the path that has the second least total cost and does not use any part of the shortest path) has a total cost (in $$INR$$) of