1. Using the syntax of C, write a recursive-descent subprogram named that corresponds to the following rules (taken from the C99 standard): initializer: assignment-expression l initializer-list I l initializer-list, ) Note that and are terminals, not metasymbols. Assume that recursive-descent subprograms named assignment-expression and initializer-list already exist. 1. Using the syntax of C, write a recursive-descent subprogram named that corresponds to the following rules (taken from the C99 standard): initializer: assignment-expression l initializer-list I l initializer-list, ) Note that and are terminals, not metasymbols. Assume that recursive-descent subprograms named assignment-expression and initializer-list already exist