Polynomial algorithms with the estimates $frac 34$ and $frac 56$ for the traveling salesman problem of the maximum