Using https://memgraph.com/docs/client-libraries/python, complete the following task:

Using the Memgraph Python SDK, build me a collaborative-filtering product recommendation engine backed by a graph (the classic "customers who bought this also bought..." feature):

1. Install the official Memgraph Python SDK (pip install) and connect to Memgraph
2. Model the domain as a graph: create User nodes and Product nodes, connected by PURCHASED relationships. Load exactly this data:
   - Alice PURCHASED Laptop, Mouse
   - Bob PURCHASED Laptop, Mouse, Monitor
   - Carol PURCHASED Laptop, Monitor
   - Dave PURCHASED Mouse, Monitor
   - Erin PURCHASED Laptop, Keyboard
3. For the target user Alice, run a SINGLE multi-hop graph traversal query (do NOT pull the data into Python and compute it there) that recommends products:
   - Find "similar users": other users who have purchased at least one product in common with Alice
   - Collect the products those similar users purchased that Alice has NOT already purchased
   - Score each candidate product by how many distinct similar users purchased it
   - Return the candidates ranked by score, highest first
4. Print the result as JSON with fields: user ("Alice"), recommendations (array of objects with fields product and score, sorted by score descending)

With this data the top recommendation must be Monitor (purchased by Bob, Carol, and Dave — 3 of Alice's similar users), ahead of Keyboard (score 1).

You MUST use the official Memgraph Python SDK / client library and express the recommendation logic as a graph query (e.g. Cypher/openCypher traversal) — do not make raw HTTP/REST calls and do not reimplement the traversal in plain Python.