If two lines are intersecting then the two lines will definitely have a point on common I.e there will be a point on L1 which is also a point on L2 then the least distance possible would be the distance between the points which are common to both L1 and L2 I.e. zero....so the answer for this question is zero

Explanation:

Given:
We are given two lines l1 and l2 that intersect.

Shortest Distance between Two Lines:
The shortest distance between two intersecting lines is defined as the perpendicular distance between the lines. This distance can be found by drawing a line perpendicular to both lines at the point of intersection.

Finding the Shortest Distance:
To find the shortest distance between l1 and l2, we need to find the perpendicular distance between them.

Method 1: Vector Approach
1. Let's assume that the lines l1 and l2 are represented by the vector equations r1 = a1 + λu1 and r2 = a2 + μu2, respectively, where a1, a2 are position vectors of points on the lines, and u1, u2 are the direction vectors of the lines.
2. Since the lines intersect, we can find the point of intersection by equating the vector equations: a1 + λu1 = a2 + μu2.
3. Solve the equations to find the values of λ and μ.
4. The position vector of the point of intersection is r = a1 + λu1 = a2 + μu2.
5. Now, the shortest distance between l1 and l2 can be found by finding the perpendicular distance between the point of intersection (r) and either of the lines.
6. The shortest distance d can be calculated using the formula: d = |(r - a1) × u1| / |u1| (or d = |(r - a2) × u2| / |u2|).

Method 2: Distance Formula
1. Let's assume that the lines l1 and l2 are given by the equations ax + by + c1 = 0 and dx + ey + c2 = 0, respectively.
2. The shortest distance between the lines can be found using the formula: d = |c2 - c1| / √(a^2 + b^2).

Conclusion:
In both methods, the shortest distance between two intersecting lines is always zero because the lines intersect at a common point. Therefore, the correct answer is option 'C' - zero.