nodes: 0, module; 1, function_definition; 2, function_name:multisorted; 3, parameters; 4, block; 5, identifier:items; 6, list_splat_pattern; 7, expression_statement; 8, if_statement; 9, for_statement; 10, return_statement; 11, identifier:keys; 12, comment:"""Sort by multiple attributes.
  
      Args:
          items: An iterable series to be sorted.
          *keys: Key objects which extract key values from the items.
              The first key will be the most significant, and the
              last key the least significant. If no key functions
              are provided, the items will be sorted in ascending
              natural order.
      Returns:
          A list of items sorted according to keys.
      """; 13, comparison_operator:len(keys) == 0; 14, block; 15, identifier:key; 16, call; 17, block; 18, identifier:items; 19, call; 20, integer:0; 21, expression_statement; 22, identifier:reversed; 23, argument_list; 24, expression_statement; 25, identifier:len; 26, argument_list; 27, assignment; 28, identifier:keys; 29, assignment; 30, identifier:keys; 31, identifier:keys; 32, list; 33, identifier:items; 34, call; 35, call; 36, identifier:sorted; 37, argument_list; 38, identifier:asc; 39, argument_list; 40, identifier:items; 41, keyword_argument; 42, keyword_argument; 43, identifier:key; 44, attribute; 45, identifier:reverse; 46, attribute; 47, identifier:key; 48, identifier:func; 49, identifier:key; 50, identifier:reverse
code: def multisorted(items, *keys):
      """Sort by multiple attributes.
  
      Args:
          items: An iterable series to be sorted.
          *keys: Key objects which extract key values from the items.
              The first key will be the most significant, and the
              last key the least significant. If no key functions
              are provided, the items will be sorted in ascending
              natural order.
      Returns:
          A list of items sorted according to keys.
      """
      if len(keys) == 0:
          keys = [asc()]
      for key in reversed(keys):
          items = sorted(items, key=key.func, reverse=key.reverse)
      return items