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.

$\backslash$table$[[$ID$,($ES resource load chart$),3,,5,6,4,8,9,10,12,13,],[$RES$,$DUR $,2.,$ES$,LF,$SL$,,1,2,,7,11,\backslash$table$[[3,14]]],[1,2P,2,0,2,0,2,2,,,M,,47,111,$min,$4,,,,],[2,2P,6,2,10,2,,,2,2,2,2,2,2,,,,,,],[3,2P,4,2,6,0,,,2,2,2,2,,,,H,,,,],[4,10,2,2,10,6,,,1,1,,,=,=,{)}^H,,,,,],[5,1P,2,6,10,2,,,,,,,1,1,$H$1$H$,,,,,],[6,1P,4,6,10,0,,,,,,,1,1,1,1,,,,],[7,1P,2,10,12,0,,,,,,,,,,,1,1,,],[,,$otal re:$,$sour,elolas,,$2P,2P,5P,5$P$,4$P$,4p,4$P$,4$P$,$ip$,$IP$,1$P$,,,]]$