true or false give a short explanation (please only answer the english part of the question)

viii. If problem A can be reduced to problem B, and B can be reduced to C, then A can also be reduced to C. A problemi B problemine, B problemi C'ye indirgenebilirse, A da C'ye indirgenebilir. IX. If there exists a dynamic programming algorithm with n2 subproblems, it is possible that the space usage could be O(n). n2 alt problemli dinamik bir programlama algoritmas varsa, alan kullanm O(n) olabilir. X. If all the edge capacities in a graph are an integer multiple of 7, then the value of the maximum flow will be a multiple of 7. Bir izgedeki tm kenar kapasiteleri 7'nin tam katysa, maksimum akn deeri 7'nin kat olacaktr