**Title: Creating a Priority List Using the Decreasing Time Algorithm****Instructions:**Utilize the decreasing time algorithm to establish a priority list for the directed graph (digraph) depicted below.**Graph Overview:**The digraph consists of seven tasks labeled T1 through T7. Each task has an assigned number representing its respective time in parentheses.- **T1** (7)- **T2** (12)- **T3** (9)- **T4** (2)- **T5** (6)- **T6** (8)- **T7** (10)The diagram illustrates the dependencies between tasks with directed arrows.**Objective:**Create a priority list where tasks are listed in order of decreasing time. The priority list should reflect the order in which tasks should be prioritized based on their time, starting from the longest to the shortest.**Input Priority List:**A text box is provided to input the priority list as a sequence of task numbers. Enter them separated by commas. Example format: 1,2,3,4,5,6,7,8,9,10.**Example:**If T3 has the highest priority, followed by T1 and then T6, the list would appear as: 3,1,6.This exercise helps in understanding task prioritization based on time for efficient workflow management.

Name: **Title: Creating a Priority List Using the Decreasing Time Algorithm
Uploaded: 2024-03-20T07:07:37.000Z
Channel: Bartleby
Description: **Title: Creating a Priority List Using the Decreasing Time Algorithm****Instructions:**Utilize the decreasing time algorithm to establish a priority list for the directed graph (digraph) depicted below.**Graph Overview:**The digraph consists of sev