Sequential Recipe Maker

Problem Statement

Sequential Recipe Maker Problem Description You are given a string value F, where each value represents the initial number of available units of an item. You are also given a string value R, where multiple recipes are provided as a comma-separated list. Each recipe is a string of digits, representing the number of units of each item required. You have to follow some rules, as below: Start with the given item frequencies. Process each recipe in the given order (left to right in the recipes string). For each recipe: If there are enough items available to make the recipe, consume the items and count the recipe as completed. If not, skip the recipe (do not revisit it later). Your task is to find and return an integer value representing the total number of recipes that can be successfully made in order. Input Specification: input1: A string value F, representing available item frequencies, given as comma-separated digits. input2: A string R, representing a comma-separated list of recipe str