Consider a scheduling problem with 3 jobs in a cloud environment. The cloud uses the dominant resource fair scheduling strategy to assign resources to jobs. Each job should be represented with at least one task.

Job A's tasks each require 2 CPUs and 4 GB RAM. Job B's tasks each require 3 CPUs and 3 GB RAM. Job C's tasks each require 2 CPUs and 3 GB RAM.

The cloud has a total of 18 CPUs and 24 GB RAM.

For each job, state if it is CPU or RAM dominant.

Assume a data center where this scheduling algorithm is dynamically applied. What is the maximum number of tasks that can be run for each job while still being fair and how big is the share of that job's dominant resource? The fraction should be provided as a number between 0 and 1 (e.g. 0.250 = 25%) with three decimal places. When all jobs have an equal share, the next resources get assigned in alphabetical order, i.e. A < B < C.