Explain Flajolet-Martin algorithm to count the distinct elements in a stream.

Flajolet-Martin :-

• Flajolet-Martin algorithm approximates the number of unique objects in a stream or a database in one pass.

• If the stream contains n elements with m of them unique, this algorithm runs in O(n) time and needs O(log(m)) memory. So the real innovation here is the memory usage, in …