Which statement about Path Compression is correct?

A. it can support pattern search in time proportional to the pattern length B. it exists only for directed acyclic graphs C. it flattens the parent structure over time D. it bounds a function from below for sufficiently large inputs