Based on the network diagram and resource schedule below, using the parallel method heuristic and assuming only $3$ resources are available, determine the period in which the overall project will actually be completed.

ES resource load chart

$\backslash$table$[[$ID$,$RES,DUR,ES$,$LF$,$SL$.,,1,2,3,4,5,6,6,7,8,9,10,11,12,13,\backslash$table$[[3,14]]],[1,2P,2,0,2,0,2,2,,,,,,,,,,,,,,],[2,2P,6,2,10,2,,,2,2,2,,2,2,2,,,,,,,],[3,2P,4,2,6,0,,,2,2,2,,2,,,,,,,,,],[4,1P,2,2,10,6,,,1,1,,,,,,,,,,,,],[5,10,2,6,10,2,,,,,,,,1,1,,,,,,,],[6,1P,4,6,10,0,,,,,,,,1,1,1,1,,,,,],[7,10,2,10,12,0,,,,,,,,,,,,1,,1,,],[,,$otal re$,$sourd,e lood,,$2p,2P,5P,5P,4!,,4$P$,4$P$,4P,1P,1P,11,P,1p,,]]$