LOL. Does each line represent one function? Cos it's nonsense if F represents that entire representation which doesn't seem to be the case.
All the simplified expressions are A+B. Let each expression be represented by 0, 1...n. F0 (after initial expansion) = CABC + ABB'C + ABC + A + BBA + B = ABC + AC+ ABC + A + BA = ABC + A + B = A + B F1 = AC(B+1) + A + B = AC + A + B = A(C+1) + B = A + B F2 = Taken from F0 last part. CAB + A + B is equivalent to ABC + A + B = A + B F3 = A + B, already simplified. Can look into using kanaugh map if you wish, it has helped me alot in boolean simplification questions. As for the logic diagram:
