Iterate backwards on zdiff/zinter/zunion to optimize for zslInsert (#8105)

In the iterator for these functions, we'll traverse the sorted sets
in a reversed way so that largest elements come first. We prefer
this order because it's optimized for insertion in a skiplist, which
is the destination of the elements being iterated in there functions.