Heuristic CE for SargableNode should be symmetric to the analogous estimates for FilterNode. FilterNode increases selectivity by 10% when the path expression of a condition contains a PathTraverse node because this assumes there may be array data in the path.

This task should do the same for heuristic estimation of SargableNode.

The information about the path is stored inside the key of PartialSchemaRequirements, so should be easy to check.