What is the term for an algorithm used by html5 to compress and decompress files?

Set $r$ is a set of rectangles such that (1) only the grid points shown here are used as vertices, (2) all sides are vertical or horizontal and (3) no two rectangles in the set are congruent. if $r$ contains the maximum possible number of rectangles given these conditions, what fraction of the rectangles in set $r$ are squares? express your answer as a common fraction.

Table of values relation g values x, y 2,2 /3,5 /4,9 /5,13 which ordered pair is in g inverse? a(-2,2) b(-3,-5) c)4,9) d( 13,5)

Solve 13 + w/7= -18 (w/7 is a fraction)