... −1.6 .8 Maximal Flow 171(a)(b)(c)(d)(e)(4, 1)(3, 1) 2 11131 2 2 2 35416(1, 2) (–, ∞) (2, 1) (2, 1)(1, 1)(4, 1) 2 23456111111113 2 2(–, ∞)(4, 1)(3, 2) (3, 1)(1, 2) (5, ... following requirements:a) a =1015 7 8 b = 8 6 9 12 5b) a = 2 3 4 56 b =6 5 4 3 2 c) a = 2 4 3 15 2 b = 6 4 2 3 2 2. Transform the following to lower triangular form, ... 0 20 20 186 Chapter 7 Basic Properties of Solutions and AlgorithmsExample 1. Consider the problemminimize fx1x 2 =x 2 1−x1x 2 +x 2 2−3x 2 There are no constraints, so =E 2 ....