Mapping Techniques for Load Balancing used in parallel algorithms can be broadly classified into two categories: static and dynamic. Mapping based on task partitioning is an important technique for achieving efficient parallel processing. Task partitioning is a common technique used in Task-dependency graph with lequal time of execution parallel computing to divide a large computational task into smaller, more manageable subtasks that can be executed simultaneously. A task-dependency graph is a way of representing the dependencies between different subtasks, where nodes represent the subtasks and edges represent the dependencies. For the task graphs given in Figure (below), determine the following: 1. Maximum degree of concurrency. 2. Critical path length. 3. Maximum achievable speedup over one process assuming that an arbitrarily large number of processes is available. 4. The maximum achievable speedup if the number of processes is limited to 2,4 , and 8 . Task-dependency graph with equal time of execution