On edge-disjoint pairs of matchings

For a graph image, consider the pairs of edge-disjoint matchings whose union consists of as many edges as possible. Let image be the largest matching among such pairs. Let image be a maximum matching of image. We show that 5/4 is a tight upper bound for image.