Please Draw the flow chart

Recursive Approach: First, check if the target postal code exists in the dictionary. If it doesn't, return None. Define a recursive function called find_indices that takes in the array, the target's mapped number, the current index, and the start, end, and count variables. If the current index is greater than or equal to the length of the array, return a list containing start, end, and count. If the current element is equal to the target's mapped number, check if start is None. If it is, set start to the current index. Set end to the current index. Increment the count by 1 . Call find_indices recursively with the next index and the updated start, end, and count variables. After all recursive calls have returned, return a list containing start, end, and count