You are working on a web crawler application that needs to efficiently check whether a URL has been

previously processed to avoid redundant processing. To optimize this process, you decide to implement a

simple Bloom filter for URL caching. Your task is to create a program that adheres to the following

specifications:

$$ Implement a Bloom filter with a configurable size and number of hash functions for URL caching.

$$ Develop functions to add URLs to the Bloom filter and check whether a URL is likely to be in the filter.

$$ Ensure that the implementation provides a consistent output for the same set of operations across different environments.

Your program should accept input in the following format:

$1.$ For adding a URL: ADD url

$2.$ For checking URL existence: CONTAINS url

Your program should produce output in the following format:

$1.$ For adding a URL: Added: url

$2.$ For checking URL existence: URL Existence Check for url: True$/$False

Sample Input

Input will be taken from the file$($inputPS$03.$txt$).$

ADD https:$//$example$.$com$/$page$1$

CONTAINS https:$//$example$.$com$/$page$1$

ADD https:$//$example$.$com$/$page$2$

CONTAINS https:$//$example$.$com$/$page$2$

CONTAINS https:$//$example$.$com$/$page$3$

Note that the input$/$output data shown here is only for understanding and testing, the actual file used

for evaluation will be different.

Sample Output

Display the output in outputPS$03.$txt$.$

Added: https:$//$example$.$com$/$page$1$

URL Existence Check for https:$//$example$.$com$/$page$1$: True

Added: https:$//$example$.$com$/$page$2$

URL Existence Check for https:$//$example$.$com$/$page$2$: True

URL Existence Check for https:$//$example$.$com$/$page$3$: False