Draw the PERT network for the activities whose three time estimates are given in the table.
Activity
|
Predecessor
activity
|
Optimistic
Time (to)
|
Pessimistic
Time (tp)
|
Most likely
time
|
te
|
A
|
--
|
1
|
5
|
3
|
3
|
B
|
--
|
2
|
4
|
3
|
3
|
C
|
--
|
3
|
5
|
4
|
4
|
D
|
A
|
2
|
10
|
9
|
8
|
E
|
C
|
4
|
6
|
5
|
5
|
F
|
B, D, E
|
5
|
13
|
6
|
7
|
G
|
A
|
2
|
6
|
4
|
4
|
H
|
G,F
|
0
|
6
|
3
|
3
|
From the three time estimates obtain the expected times of all the activities and slacks of all the events. Also find the critical path.