Complete the code to get the union of sets 'set1' and 'set2'.
SUNION [1]The SUNION command returns all unique members from both sets. You need to specify both set names separated by space.
Complete the code to find the intersection of sets 'fruits' and 'citrus'.
SINTER [1]SINTER returns members common to all given sets. The set names must be separated by spaces, not commas.
Fix the error in the code to get the difference of sets 'A' and 'B'.
SDIFF [1]SDIFF returns members in the first set that are not in the others. Set names must be separated by spaces, not commas.
Fill all three blanks to get the union of 'setX' and 'setY' and store it in 'resultSet'.
SUNIONSTORE [1] [2] [3]
SUNIONSTORE stores the union of given sets into the destination key. The first argument is the destination, followed by the sets.
Fill all three blanks to store the difference of 'set1' and 'set2' in 'diffSet'.
SDIFFSTORE [1] [2] [3]
SDIFFSTORE stores the difference of the first set minus the others into the destination key. The order is destination, then sets.