Consider a uni-processor system executing four tasks T1, T2, T3, T4 each of which is composed of 10 sequence of jobs which arrive periodically at interval of 2, 4, 8, 16 ms resp. The priority of each task is directly proportional to its period and available tasks are scheduled based on priority, with highest priority task scheduled first. Each instance of T1, T2, T3, T4 requires execution time of 1, 2, 4, 6 ms resp. Given all tasks initially arrive at t=0, the 2nd instance of T3 completes its execution at the end of ______ ms.