Graph:
A -- B
Solution with seed 0:
HASH_JOIN
---leftEmbeddingField: c
---rightEmbeddingField: (none)
---joinPredicates:
------c = a
---Outer:
------COLLSCAN
---------ns = test.b
---------filter = $and
---------nodeId = 1
---------fetched = 1
---------sortedByDiskLoc = 0
---------providedSorts = {baseSortPattern: {}, ignoredFields: []}
---Inner:
------COLLSCAN
---------ns = test.a
---------filter = $and
---------nodeId = 2
---------fetched = 1
---------sortedByDiskLoc = 0
---------providedSorts = {baseSortPattern: {}, ignoredFields: []}

Solution with seed 1:
HASH_JOIN
---leftEmbeddingField: (none)
---rightEmbeddingField: c
---joinPredicates:
------a = c
---Outer:
------COLLSCAN
---------ns = test.a
---------filter = $and
---------nodeId = 1
---------fetched = 1
---------sortedByDiskLoc = 0
---------providedSorts = {baseSortPattern: {}, ignoredFields: []}
---Inner:
------COLLSCAN
---------ns = test.b
---------filter = $and
---------nodeId = 2
---------fetched = 1
---------sortedByDiskLoc = 0
---------providedSorts = {baseSortPattern: {}, ignoredFields: []}

With retries force INLJ, Graph:
A -- B
Solution with seed 9:
INDEXED_NESTED_LOOP_JOIN
---leftEmbeddingField: c
---rightEmbeddingField: (none)
---joinPredicates:
------c = a
---Outer:
------COLLSCAN
---------ns = test.b
---------filter = $and
---------nodeId = 1
---------fetched = 1
---------sortedByDiskLoc = 0
---------providedSorts = {baseSortPattern: {}, ignoredFields: []}
---Inner:
------FETCH
---------ns = test.a
---------nodeId = 3
---------fetched = 1
---------sortedByDiskLoc = 0
---------providedSorts = {baseSortPattern: {}, ignoredFields: []}
---------Child:
------------INDEX_PROBE
---------------Namespace: test.a Index: { a: 1 }

