Implement staircase printing and distributed mode/median

Implement three related routines. The first two build a staircase of text rows; the third coordinates worker nodes to compute global statistics under a byte-cost model. Part 1: Star staircase Given an integer n, construct a staircase with n rows. Row i (1-indexed) must contain exactly i copies of the character '*', and adjacent copies in the same row are separated by exactly one space. Return the result as a list of strings, one string per row. A row must not have a space…