Critical Priority Batch

Problem Statement

Critical Priority Batch Problem Description In a batch operating system resources are identified by a unique letter from the English alphabet. The most highly demanded resources are identified by one of five characters (a,e,i,o,u). The requests from the processes are concatenated in a string in the same order in which they are received. A pre-defined algorithm forms batches, assigns priority and stores all this information in the system. A batch contains a sequence of consecutive process requests. The critical priority batch is the longest sequence of requests for highly demanded resources where no resources in the consecutive requests are the same. The algorithm must store the number of requests in the critical priority batch. Write an algorithm to find the number of requests in the critical priority batch. Input The input consists of a string – resourceIDs, representing the resource IDs requested by the processes in order. Output Print an integer representing the number of requests i